Proceedings of the fourth ACM workshop on Formal methods in security
Bibliographic record
Abstract
This volume contains the proceedings of the Fourth ACM Workshop on Formal Methods in Security Engineering (FMSE'06) held in Fairfax, Virginia, November 3rd 2006, in conjunction with the 13th ACM Conference on Computer and Communications Security.Information security has become a crucial concern for the commercial deployment of almost all applications and middleware. Although this is commonly recognized, the incorporation of security requirements in the software development process is not yet well understood. The deployment of security mechanisms is often ad hoc, without a formal security specification or analysis, and practically always without a formal security validation of the final product. Progress is being made, but there remains a wide gap between high-level security models and actual code development.The purpose of FMSE is to bring together researchers and practitioners from both the security and the software engineering communities, from academia and industry, who are working to apply formal methods to the design and validation of large-scale systems. The scope of the workshop -- as indicated by the call for papers -- covers the security and formal methods aspects of: security specification techniques, formal trust models, combination of formal techniques with semi-formal techniques like UML, formal analyses of specific security properties relevant to software development, security-preserving composition and refinement of processes, symbolic and computational models of security protocols, integration of security aspects into formal development methods and tools, access control policies, information flow, risk management and network security, formal analysis of firewalls and intrusion detection systems, trusted computing, and case studies.As for previous years, the paper selection process was very competitive. Our call for papers attracted 21 submissions from Asia, North Africa, Canada, Europe, Russia, and the United States. The program committee accepted 7 papers for presentation at the workshop. Many high-quality papers had to be rejected. In addition, the program includes invited talks from Joshua Guttman and Steve Zdancewic.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".