Sciweavers

2872 search results - page 246 / 575
» On (Omega-)Regular Model Checking
Sort
View
LICS
2009
IEEE
15 years 11 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 8 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 4 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 4 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
FOSSACS
2011
Springer
14 years 7 months ago
Irrelevance in Type Theory with a Heterogeneous Equality Judgement
Dependently typed programs contain an excessive amount of static terms which are necessary to please the type checker but irrelevant for computation. To obtain reasonable performan...
Andreas Abel