Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
John P. Gallagher, Kim S. Henriksen, Gourinath Ban...
This paper discusses the development of a computational modeling and analysis toolkit to construct, animate, and biomechanically analyze sophisticated models of vertebrates. Users...
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Background: Bioinformatic analyses typically proceed as chains of data-processing tasks. A pipeline, or ‘workflow’, is a well-defined protocol, with a specific structure defin...
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...