Sciweavers

143 search results - page 28 / 29
» Termination of Well-Typed Logic Programs
Sort
View
LDTA
2010
13 years 7 months ago
Faster ambiguity detection by grammar filtering
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
H. J. S. Basten, Jurgen J. Vinju
SIGSOFT
2007
ACM
14 years 8 months ago
Quantitative verification: models techniques and tools
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...
Marta Z. Kwiatkowska
WLP
1997
Springer
13 years 11 months ago
Constrained Partial Deduction
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
Michael Leuschel, Danny De Schreye
IJCSA
2006
95views more  IJCSA 2006»
13 years 7 months ago
Modeling and Formal Verification of DHCP Using SPIN
The Dynamic Host Configuration Protocol (DHCP) is a widely used communication protocol. In this paper, a portion of the protocol is chosen for modeling and verification, namely th...
Syed M. S. Islam, Mohammed H. Sqalli, Sohel Khan
ISSTA
2004
ACM
14 years 24 days ago
Exploiting purity for atomicity
The notion that certain procedures are atomic is a fundamental correctness property of many multithreaded software systems. A procedure is atomic if for every execution there is a...
Cormac Flanagan, Stephen N. Freund, Shaz Qadeer