Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
Multi-stage programming languages provide a convenient notation for explicitly staging programs. Staging a definitional interpreter for a domain specific language is one way of de...
Teachers working in robotics classes face a major problem: how to keep track on individual students’ or even small groups’ progress in a class of 30-40 students. An agency app...
Ilkka Jormanainen, Yuejun Zhang, Erkki Sutinen, Ki...
Long-running applications such as network services require continuous uptime but also frequent changes to the software. To avoid downtime for software maintenance, applications mu...
Abstract. Modern termination provers rely on a safety checker to construct disjunctively well-founded transition invariants. This safety check is known to be the bottleneck of the ...
Daniel Kroening, Natasha Sharygina, Aliaksei Tsito...