65 search results - page 6 / 13 » Parameterised Boolean Equation Systems (Extended Abstract) |
ENTCS
2008
13 years 9 months ago
2008
Following earlier work, a modal logic for T-coalgebras is a functor L on a suitable variety. Syntax and proof system of the logic are given by presentations of the functor. This p...
CADE
2007
Springer
14 years 10 months ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
ICALP
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted n...
RTA
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
ICRA
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract— Gait evaluation techniques that use Stokes’s theorem to integrate a system’s equations of motion have traditionally been limited to finding only the net rotations ...