Sciweavers

4502 search results - page 783 / 901
» Regular Model Checking
Sort
View
142
Voted
ICSE
2008
IEEE-ACM
16 years 4 months ago
An ontology-driven software architecture evaluation method
Software architecture evaluation has a crucial role in the life cycle of software intensive systems. In this paper we propose an approach to empower a software architecture evalua...
Aida Erfanian, Fereidoun Shams Aliee
FOSSACS
2010
Springer
15 years 11 months ago
Retaining the Probabilities in Probabilistic Testing Theory
Abstract. This paper considers the probabilistic may/must testing theory for processes having external, internal, and probabilistic choices. We observe that the underlying testing ...
Sonja Georgievska, Suzana Andova
135
Voted
CAV
2009
Springer
182views Hardware» more  CAV 2009»
15 years 11 months ago
Generalizing DPLL to Richer Logics
The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical deduction, in which each process guides the other....
Kenneth L. McMillan, Andreas Kuehlmann, Mooly Sagi...
LATA
2009
Springer
15 years 11 months ago
Rigid Tree Automata
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
Florent Jacquemard, Francis Klay, Camille Vacher
TACAS
2009
Springer
131views Algorithms» more  TACAS 2009»
15 years 11 months ago
Verifying Reference Counting Implementations
Reference counting is a widely-used resource management idiom which maintains a count of references to each resource by incrementing the count upon an acquisition, and decrementing...
Michael Emmi, Ranjit Jhala, Eddie Kohler, Rupak Ma...