501 search results - page 83 / 101 » Using Abstraction to Verify Arbitrary Temporal Properties |
LATA
2009
Springer
15 years 4 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
IJCM
2002
14 years 9 months ago
2002
Abstract. The class of systems of uniform recurrence equations (UREs) is closed under unimodular transformations. As a result, every systolic array described by a unimodular mappin...
TSE
2010
14 years 8 months ago
2010
—Discovering program behaviors and functionalities can ease program comprehension and verification. Existing program analysis approaches have used text mining algorithms to infer...
103
click to vote
ASIAN
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. Language-based information flow analysis is used to statically examine a program for information flows between objects of different security domains, and to verify these ...
117
click to vote
CALCO
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We use coalgebraic methods to describe finitely generated free Heyting algebras. Heyting algebras are axiomatized by rank 0-1 axioms. In the process of constructing free...