An introduction to Estelle: a specification language for distributed systems
Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
Finite representations of CCS and TCSP programs by automata and Petri nets
Finite representations of CCS and TCSP programs by automata and Petri nets
The ESTEREL synchronous programming language: design, semantics, implementation
Science of Computer Programming
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Compilation and verification of LOTOS specifications
Proceedings of the IFIP WG6.1 Tenth International Symposium on Protocol Specification, Testing and Verification X
STG: A Symbolic Test Generation Tool
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Implementing LOTOS Specifications by Communicating State Machines
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Invariants in Process Algebra with Data
CONCUR '94 Proceedings of the Concurrency Theory
Compiler Construction Using LOTOS NT
CC '02 Proceedings of the 11th International Conference on Compiler Construction
IF: An Intermediate Representation and Validation Environment for Timed Asynchronous Systems
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
IF-2.0: A Validation Environment for Component-Based Real-Time Systems
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
An Approach to Symbolic Test Generation
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
Nets, Terms and Formulas (Cambridge Tracts in Theoretical Computer Science)
Nets, Terms and Formulas (Cambridge Tracts in Theoretical Computer Science)
Towards Property Oriented Testing
Electronic Notes in Theoretical Computer Science (ENTCS)
Automatic Model-Based Generation of Parameterized Test Cases Using Data Abstraction
Electronic Notes in Theoretical Computer Science (ENTCS)
Reflections on the Future of Concurrency Theory in General and Process Calculi in Particular
Electronic Notes in Theoretical Computer Science (ENTCS)
Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Bridging the chasm between MDE and the world of compilation
Software and Systems Modeling (SoSyM)
| Hi-index | 0.00 |
One central problem in the computer-aided verification of concurrent systems consisting of communicating sequential processes with data is to find suitable symbolic models. Such models should provide a compact computer representation for control and data flows, and should be appropriate for mainstream verification techniques such as model checking and theorem proving. A number of symbolic models have been proposed, many of which based on the guarded commands (also known as condition/action) paradigm. In this paper, we draw attention to the limitations of this paradigm and propose a better model named NTIF (New Technology Intermediate Form), which is well-adapted to compiling high-level, concurrent languages (such as the recent E-LOTOS standard). Finally, we present two software tools developed for NTIF and report about the use of NTIF for modeling two embedded applications in smart cards.