4617 search results - page 663 / 924 » Automation of Diagrammatic Reasoning |
193
click to vote
DAC
2006
ACM
16 years 8 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
182
click to vote
WWW
2007
ACM
16 years 8 months ago
2007
ACM
XACML has emerged as a popular access control language on the Web, but because of its rich expressiveness, it has proved difficult to analyze in an automated fashion. In this pape...
208
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
Safety and security guarantees for individual applications in general depend on assumptions on the given context provided by distributed instances of operating systems, hardware pl...
188
click to vote
CADE
2006
Springer
16 years 7 months ago
2006
Springer
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
151
click to vote
CADE
2005
Springer
16 years 7 months ago
2005
Springer
In many theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in ...