200 search results - page 24 / 40 » Invariant Logics |
148
click to vote
TNN
2010
14 years 10 months ago
2010
This paper provides a comprehensive framework for the state space approach to Boolean networks. First, it surveys the authors' recent work on the topic: Using semitensor produ...
140
Voted
CADE
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. Methods exploiting problem symmetries have been very successful in several areas including constraint programming and SAT solving. We here recast a technique to enhance t...
119
click to vote
FOSSACS
2009
Springer
15 years 10 months ago
2009
Springer
Standard analysis on recursive data structures restrict their attention to shape properties (for instance, a program that manipulates a list returns a list), excluding properties t...
148
Voted
TPHOL
2005
IEEE
15 years 9 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
107
Voted
SAC
2009
ACM
15 years 10 months ago
2009
ACM
This paper presents a methodology for interoperability testing based on contextual signatures and passive testing with invariants. The concept of contextual signature offers a fra...