Sciweavers

261 search results - page 46 / 53
» A New Unfolding Approach to LTL Model Checking
Sort
View
CORR
2007
Springer
170views Education» more  CORR 2007»
13 years 7 months ago
Animation of virtual mannequins, robot-like simulation or motion captures
— In order to optimize the costs and time of design of the new products while improving their quality, concurrent engineering is based on the digital model of these products, the...
Damien Chablat
ASE
2002
160views more  ASE 2002»
13 years 7 months ago
Proving Invariants of I/O Automata with TAME
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
Myla Archer, Constance L. Heitmeyer, Elvinia Ricco...
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
14 years 15 hour ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
POPL
2012
ACM
12 years 3 months ago
Playing in the grey area of proofs
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
Krystof Hoder, Laura Kovács, Andrei Voronko...
SIMUTOOLS
2008
13 years 9 months ago
Snoopy: a tool to design and animate/simulate graph-based formalisms
We sketch the fundamental properties and features of Snoopy, a tool to model and execute (animate, simulate) hierarchical graph-based system descriptions. The tool comes along wit...
Monika Heiner, Ronny Richter, Martin Schwarick