- April 30, 2012(Extended)
- Full Paper Submission
- June 18, 2012
- June 22, 2012
- Acceptance/Rejection Notification
- July 16, 2012
- Camera Ready Copy Due
Conference:
November 12–16, 2012
- September 30, 2012
- Program at a Glance has been Updated.
- August 6, 2012
- Registration is available now.
- June 29, 2012
- Accepted papers has been Updated.
- April 25, 2012
- Web style has been changed.
- Jan 30, 2012
- CFP has been revised.
- Nov 8, 2011
- Web site open.
2012 Accepted Papers
ICFEM 2012: 14th International Conference on Formal Engineering Methods
12th-16th, November, 2012
Kyoto Research Park, Kyoto, Japan
URL: http://www.jaist.ac.jp/icfem2012
Predicate Analysis with Block-Abstraction Memoization
Equational Abstraction Refinement for Certified Tree Regular Model Checking
Towards a Formal Verification Methodology for Collective Robotic Systems
Symbolic Model-Checking of Stateful Timed CSP using BDD and Digitization
Verification of ATL Transformations Using Transformation Models and Model Finders
Towards Certified Runtime Verification
A Practical Loop Invariant Generation Approach Based on Random Testing, Constraint Solving and Verification
Variable Permissions for Concurrency Verification
Heuristic-Guided Abstraction Refinement for Concurrent Systems
A Concurrent Temporal Programming Model with Atomic Blocks
Complementary Methodologies for Developing Hybrid Systems with Event-B
A Temporal Logic with Mean-Payoff Constraints
An Analytical and Experimental Comparison of CSP Extensions and Tools
Automatic Generation of Provably Correct Embedded Systems
Modeling Resource-Aware Virtualized Applications for the Cloud in Real-Time ABS
More Anti-Chain Based Refinement Checking
State Space c-Reductions of Concurrent Systems in Rewriting Logic
Time Constraints with Temporal Logic Programming
Separation Predicates: a Taste of Separation Logic in First-Order Logic
A Composable Mixed Mode Concurrency Control Semantics for Transactional Programs
Annotation-aided Automated Incremental Analysis for Alloy via Domain Specific Solvers
Quantitative Program Dependence Graphs
Quantitative Analysis of Information Flow using Theorem Proving
The Confinement Problem in the Presence of Faults
ConSMutate: SQL Mutants for Guiding Concolic Testing of Database Applications
SMT-based False Positive Elimination in Static Program Analysis
Stepwise Satisfiability Checking Procedure for Reactive System Specifications by Tableau Method and Proof System
Specification and Model Checking of the Chandy & Lamport Distributed Snapshot Algorithm in Rewriting Logic
Modular Verification of OO Programs with Interfaces
Demonic Testing of Concurrent Programs
Modeling and Verification of Probabilistic Actor Systems using pRebeca