453 search results - page 57 / 91 » Using Symbolic Simulation for Bounded Property Checking |
130
click to vote
POPL
2011
ACM
14 years 2 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
121
click to vote
ISTCS
1992
Springer
15 years 3 months ago
1992
Springer
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...
104
click to vote
PARLE
1987
1987
Emulating Digital Logic using Transputer Networks (very High Parallelism = Simplicity = Performance)
15 years 3 months ago
Modern VLSI technology has changed the economic rules by which the balance between processing power, memory and communications is decided in computing systems. This will have a pr...
TPHOL
2005
IEEE
15 years 5 months ago
2005
IEEE
Using the HOL theorem prover, we proved the correctness of a translation from a subset of Accellera’s property specification language PSL to linear temporal logic LTL. Moreover,...
158
click to vote
FASE
2004
Springer
15 years 3 months ago
2004
Springer
Real-Time Maude is a language and tool supporting the formal specification and analysis of real-time and hybrid systems. The specification formalism is based on rewriting logic, em...