The following pages link to FM 2015: Formal Methods (Q5206946):
Displayed 14 items.
- Automated Circular Assume-Guarantee Reasoning (Q5206947) (← links)
- Narrowing Operators on Template Abstract Domains (Q5206948) (← links)
- Safety, Liveness and Run-Time Refinement for Modular Process-Aware Information Systems with Dynamic Sub Processes (Q5206949) (← links)
- Verifying Opacity of a Transactional Mutex Lock (Q5206950) (← links)
- A Framework for Correctness Criteria on Weak Memory Models (Q5206951) (← links)
- Parameter Synthesis Through Temporal Logic Specifications (Q5206952) (← links)
- Trace-Length Independent Runtime Monitoring of Quantitative Policies in LTL (Q5206953) (← links)
- Probabilistic Bisimulation for Realistic Schedulers (Q5206954) (← links)
- Proving Safety with Trace Automata and Bounded Model Checking (Q5206955) (← links)
- Axiomatization of Typed First-Order Logic (Q5206956) (← links)
- Certified Reasoning with Infinity (Q5206958) (← links)
- Direct Formal Verification of Liveness Properties in Continuous and Hybrid Dynamical Systems (Q5206959) (← links)
- Rigorous Estimation of Floating-Point Round-off Errors with Symbolic Taylor Expansions (Q5206960) (← links)
- Static Optimal Scheduling for Synchronous Data Flow Graphs with Model Checking (Q5206962) (← links)