Sciweavers

5015 search results - page 340 / 1003
» Model Checking a Path
Sort
View
LICS
2009
IEEE
16 years 1 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...
KBSE
1997
IEEE
15 years 10 months ago
NORA/HAMMR: Making Deduction-Based Software Component Retrieval Practical
Deduction-based software component retrieval uses preand postconditions as indexes and search keys and an automated theorem prover (ATP) to check whether a component matches. This...
Johann Schumann, Bernd Fischer 0002
FAC
2008
139views more  FAC 2008»
15 years 6 months ago
Network invariants for real-time systems
We extend the approach of model checking parameterized networks of processes by means of network invariants to the setting of real-time systems. We introduce timed transition stru...
Olga Grinchtein, Martin Leucker
TAP
2008
Springer
94views Hardware» more  TAP 2008»
15 years 6 months ago
Vacuity in Testing
Abstract. In recent years, we see a growing awareness to the importance of assessing the quality of specifications. In the context of model checking, this can be done by analyzing ...
Thomas Ball, Orna Kupferman
ICCAD
1999
IEEE
153views Hardware» more  ICCAD 1999»
15 years 11 months ago
Cycle time and slack optimization for VLSI-chips
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
Christoph Albrecht, Bernhard Korte, Jürgen Sc...