Sciweavers

12981 search results - page 402 / 2597
» Model Checking (Abstract)
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
FC
2010
Springer
169views Cryptology» more  FC 2010»
15 years 8 months ago
A Formal Approach for Automated Reasoning about Off-Line and Undetectable On-Line Guessing
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
Bogdan Groza, Marius Minea
TCAD
2008
90views more  TCAD 2008»
15 years 4 months ago
Application and Verification of Local Nonsemantic-Preserving Transformations in System Design
Due to the increasing abstraction gap between the initial system model and a final implementation, the verification of the respective models against each other is a formidable task...
Tarvo Raudvere, Ingo Sander, Axel Jantsch
VAMOS
2008
Springer
15 years 6 months ago
Variability Management on Behavioral Models
This paper deals with managing variability on behavioral models. Such models are generally more complex, less tractable by hand than the static, structural parts of a system descr...
Patrick Tessier, David Servat, Sébastien G&...