4047 search results - page 463 / 810 » Algebraic Model Checking |
165
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
160
click to vote
ACS
2004
15 years 6 months ago
2004
The authors have used generalised Galois Theory to construct a homotopy double groupoid of a surjective fibration of Kan simplicial sets. Here we apply this to construct a new hom...
186
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of -theories. Relying on the notion of easy intersection type theory we succes...
192
click to vote
TPLP
2002
15 years 6 months ago
2002
We study the properties of input-consuming derivations of moded logic programs. Inputconsuming derivations can be used to model the behavior of logic programs using dynamic schedu...
200
Voted
ACS
2011
15 years 1 months ago
2011
We describe an algebra for composing automata in which the actions have probabilities. We illustrate by showing how to calculate the probability of reaching deadlock in k steps in...