1894 search results - page 203 / 379 » A TLA Proof System |
125
click to vote
DLT
2008
15 years 5 months ago
2008
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
135
click to vote
IJNSEC
2008
15 years 4 months ago
2008
One approach to protect distributed systems implemented with mobile code is through program obfuscation. Disguising program intent is a form of information hiding that facilitates...
149
click to vote
IJSI
2008
15 years 4 months ago
2008
In [19], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modula...
129
click to vote
JAR
2008
15 years 4 months ago
2008
We present a simple formulation of Assumption-Commitment reasoning using CSP. In our formulation, an assumption-commitment style property of a process SYS takes the form COM SYS A...
149
click to vote
JAR
2006
15 years 4 months ago
2006
We describe an approach to verifying bit-level pipelined machine models using a combination of deductive reasoning and decision procedures. While theorem proving systems such as AC...