Sciweavers

798 search results - page 92 / 160
» Proving More Properties with Bounded Model Checking
Sort
View
TACAS
2005
Springer
124views Algorithms» more  TACAS 2005»
14 years 1 months ago
Dynamic Symmetry Reduction
Abstract. Symmetry reduction is a technique to combat the state explosion problem in temporal logic model checking. Its use with symbolic representation has suffered from the proh...
E. Allen Emerson, Thomas Wahl
ENTCS
2007
111views more  ENTCS 2007»
13 years 7 months ago
Multi Labelled Transition Systems: A Semantic Framework for Nominal Calculi
Action Labelled transition systems (LTS) have proved to be a fundamental model for describing and proving properties of concurrent systems. In this paper,Multiple Labelled Transit...
Rocco De Nicola, Michele Loreti
RTAS
2009
IEEE
14 years 2 months ago
Execution Strategies for PTIDES, a Programming Model for Distributed Embedded Systems
—We define a family of execution policies for a programming model called PTIDES (Programming Temporally Integrated Distributed Embedded Systems). A PTIDES application (factory a...
Jia Zou, Slobodan Matic, Edward A. Lee, Thomas Hui...
ICSE
2001
IEEE-ACM
14 years 4 days ago
Fast Formal Analysis of Requirements via "Topoi Diagrams"
Early testing of requirements can decrease the cost of removing errors in software projects. However, unless done carefully, that testing process can significantly add to the cos...
Tim Menzies, John D. Powell, Michael E. Houle
ESEC
1999
Springer
13 years 12 months ago
FACADE: A Typed Intermediate Language Dedicated to Smart Cards
The use of smart cards to run software modules on demand has become a major business concern for application issuers. Such downloadable executable content requires to be trusted by...
Gilles Grimaud, Jean-Louis Lanet, Jean-Jacques Van...