128
Voted
FOIKS
2006
Springer
15 years 7 months ago
2006
Springer
This paper presents a semantic foundation of temporal conceptual models used to design temporal information systems. We consider a modeling language able to express both timestampi...
131
Voted
FOIKS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. In this paper, we present a syntactic method for solving firstorder equational constraints over term algebras. The presented method exploits a novel notion of quasi-solve...
129
click to vote
FOCS
2006
IEEE
15 years 7 months ago
2006
IEEE
We consider random 3CNF formulas with n variables and m clauses. It is well known that when m > cn (for a sufficiently large constant c), most formulas are not satisfiable. How...
144
click to vote
FMICS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...