default search action
14th SEFM 2016: Vienna, Austria
- Rocco De Nicola, Eva Kühn:
Software Engineering and Formal Methods - 14th International Conference, SEFM 2016, Held as Part of STAF 2016, Vienna, Austria, July 4-8, 2016, Proceedings. Lecture Notes in Computer Science 9763, Springer 2016, ISBN 978-3-319-41590-1
Invited Papers
- Gul Agha:
Abstractions, Semantic Models and Analysis Tools for Concurrent Systems: Progress and Open Problems - (Extended Abstract). 3-8 - Erika Ábrahám, Gereon Kremer:
Satisfiability Checking: Theory and Applications. 9-23
Concurrency and Non-interference
- Oliver Schwarz, Mads Dam:
Automatic Derivation of Platform Noninterference Properties. 27-44 - Simon Doherty, John Derrick:
Linearizability and Causality. 45-60 - Nils Jähnig, Thomas Göthel, Sabine Glesner:
Refinement-Based Verification of Communicating Unstructured Code. 61-75 - Josselin Feist, Laurent Mounier, Marie-Laure Potet:
Guided Dynamic Symbolic Execution Using Subgraph Control-Flow Information. 76-81
Program Analysis
- Oana Fabiana Andreescu, Thomas P. Jensen, Stéphane Lescuyer:
Correlating Structured Inputs and Outputs in Functional Specifications. 85-103 - Tuba Yavuz:
Combining Predicate Abstraction with Fixpoint Approximations. 104-120 - Jaroslav Bendík, Nikola Benes, Jiri Barnat, Ivana Cerná:
Finding Boundary Elements in Ordered Sets with Application to Safety and Requirements Analysis. 121-136 - Christian Dernehl, Norman Hansen, Stefan Kowalewski:
Combining Abstract Interpretation with Symbolic Execution for a Static Value Range Analysis of Block Diagrams. 137-152
Model Checking
- Idress Husien, Sven Schewe:
Program Generation Using Simulated Annealing and Model Checking. 155-171 - Peter Bezdek, Nikola Benes, Jiri Barnat, Ivana Cerná:
LTL Parameter Synthesis of Parametric Timed Automata. 172-187 - Graeme Smith:
Model Checking Simulation Rules for Linearizability. 188-203 - Ivaylo Dobrikov, Michael Leuschel, Daniel Plagge:
LTL Model Checking under Fairness in ProB. 204-211
Verification
- David Hauzar, Claude Marché, Yannick Moy:
Counterexamples from Proof Failures in SPARK. 215-233 - Jera Hensel, Jürgen Giesl, Florian Frohn, Thomas Ströder:
Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution. 234-252 - Paolo Arcaini, Angelo Gargantini, Elvinia Riccobene:
SMT-Based Automatic Proof of ASM Model Refinement. 253-269 - Ke Zhang, Zongyan Qiu:
Coq Implementation of OO Verification Framework VeriJ. 270-276 - Peter Zeller, Arnd Poetzsch-Heffter:
Towards a Proof Framework for Information Systems with Weak Consistency. 277-283
Interaction and Adaptation
- Antonio Cerone:
A Cognitive Framework Based on Rewriting Logic for the Analysis of Interactive Systems. 287-303 - Anshul Gupta, Sven Schewe, Ashutosh Trivedi, Sai Krishna Deepak Maram, Bharath Kumar Padarthi:
Incentive Stackelberg Mean-Payoff Games. 304-320 - Carlos Canal, Gwen Salaün:
Stability-Based Adaptation of Asynchronously Communicating Software. 321-336 - Shaun Azzopardi, Christian Colombo, Gordon J. Pace, Brian Vella:
Compliance Checking in the Open Payments Ecosystem. 337-343
Development Methods
- Adrien Champion, Arie Gurfinkel, Temesghen Kahsai, Cesare Tinelli:
CoCoSpec: A Mode-Aware Contract Language for Reactive Systems. 347-366 - Antoine El-Hokayem, Yliès Falcone, Mohamad Jaber:
Modularizing Crosscutting Concerns in Component-Based Systems. 367-385 - Alessandro Cimatti, Ramiro Demasi, Stefano Tonetta:
Tightening a Contract Refinement. 386-402 - Lukas Ladenberger, Michael Leuschel:
BMotionWeb: A Tool for Rapid Creation of Formal Prototypes. 403-417
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.