Sciweavers

65 search results - page 13 / 13
» Parameterised Boolean Equation Systems (Extended Abstract)
Sort
View
ICFEM
2010
Springer
13 years 9 months ago
Automating Coinduction with Case Analysis
Abstract. Coinduction is a major technique employed to prove behavioral properties of systems, such as behavioral equivalence. Its automation is highly desirable, despite the fact ...
Eugen-Ioan Goriac, Dorel Lucanu, Grigore Rosu
POPL
2010
ACM
14 years 8 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...
IJRR
2006
126views more  IJRR 2006»
13 years 10 months ago
Market-based Multirobot Coordination for Complex Tasks
Current technological developments and application-driven demands are bringing us closer to the realization of autonomous multirobot systems performing increasingly complex missio...
Robert Zlot, Anthony Stentz
FPCA
1989
14 years 2 months ago
A Simple Semantics for ML Polymorphism
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
Atsushi Ohori
STOC
1990
ACM
135views Algorithms» more  STOC 1990»
14 years 2 months ago
A Separator Theorem for Graphs with an Excluded Minor and its Applications
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
Noga Alon, Paul D. Seymour, Robin Thomas