1763 search results - page 159 / 353 » A Formalization of Polytime Functions |
123
click to vote
TPHOL
2003
IEEE
15 years 9 months ago
2003
IEEE
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...
136
click to vote
CAV
2003
Springer
15 years 9 months ago
2003
Springer
Many verification problems reduce to proving the validity of formulas involving both propositional connectives and domain-specific functions and predicates. This paper presents ...
214
click to vote
WOLLIC
2010
Springer
15 years 9 months ago
2010
Springer
Recently, an axiomatization for functional dependencies (FDs) and multivalued dependencies (MVDs) has been established where arbitrary attributes can be specified as NOT NULL. Tha...
121
click to vote
APSEC
2002
IEEE
15 years 9 months ago
2002
IEEE
Continuous action systems (CAS) is a formalism intended for modeling hybrid systems (systems that combine discrete control with continuous behavior), and proving properties about ...
136
click to vote
GI
2009
Springer
15 years 8 months ago
2009
Springer
: The support of smart interaction in ubiquitous computing is among the core criteria to achieve user acceptance and thus business success. We describe an architectural framework u...