Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
UPPAAL—a tool suite for automatic verification of real-time systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Algorithmic analysis of programs with well quasi-ordered domains
Information and Computation - Special issue: LICS 1996—Part 1
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Abstraction-Based Model Checking Using Modal Transition Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Interface Theories for Component-Based Design
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Construction of Abstract State Graphs with PVS
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
An abstract interpretation toolkit for μCRL
Formal Methods in System Design
When not losing is better than winning: Abstraction and refinement for the full μ-calculus
Information and Computation
Monotonic and Downward Closed Games*
Journal of Logic and Computation
Residual for Component Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
The STSLib Project: Towards a Formal Component Model Based on STS
Electronic Notes in Theoretical Computer Science (ENTCS)
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
On determinism in modal transition systems
Theoretical Computer Science
Modal interfaces: unifying interface automata and modal specifications
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
Modal Contracts for Component-Based Design
SEFM '09 Proceedings of the 2009 Seventh IEEE International Conference on Software Engineering and Formal Methods
Modal I/O automata for interface and product line theories
ESOP'07 Proceedings of the 16th European conference on Programming
Complexity of decision problems for mixed and modal specifications
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
A Theory of Synchronous Relational Interfaces
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parametric modal transition systems
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
MIO workbench: a tool for compositional design with modal input/output interfaces
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Invited contribution: sociable interfaces
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
On weak modal compatibility, refinement, and the MIO workbench
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A Modal Interface Theory for Component-based Design
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
On modal refinement and consistency
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Ensuring reachability by design
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
| Hi-index | 0.00 |
Modal specification is a well-known formalism used as an abstraction theory for transition systems. Modal specifications are transition systems equipped with two types of transitions: must-transitions that are mandatory to any implementation, and may-transitions that are optional. The duality of transitions allows for developing a unique approach for both logical and structural compositions, and eases the step-wise refinement process for building implementations. We propose Modal Specifications with Data (MSDs), the first modal specification theory with explicit representation of data. Our new theory includes the most commonly seen ingredients of a specification theory; that is parallel composition, conjunction and quotient. As MSDs are by nature potentially infinite-state systems, we propose symbolic representations based on effective predicates. Our theory serves as a new abstraction-based formalism for transition systems with data.