12194 search results - page 349 / 2439 » cans 2010 |
194
click to vote
ENTCS
2007
15 years 6 months ago
2007
Bounded Model Checking (BMC) is one of the most paradigmatic practical applications of Boolean Satisfiability (SAT). The utilization of SAT in model checking has allowed signifi...
176
click to vote
ENTCS
2007
15 years 6 months ago
2007
In the constructive setting, membership predicates over recursive types are inhabited by terms indexing the elements that satisfy the criteria for membership. In this paper, we mo...
161
click to vote
ENTCS
2007
15 years 6 months ago
2007
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...
182
click to vote
ENTCS
2007
15 years 6 months ago
2007
Automated deduction methods should be specified not procedurally, but declaratively, as inference systems which are proved correct regardless of implementation details. Then, di...
197
click to vote
ENTCS
2007
15 years 6 months ago
2007
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...