Trace Spaces: An Efficient New Technique for State-Space Reduction

DOI10.1007/978-3-642-28869-2_14zbMath1352.68032arXiv1204.0414OpenAlexW2951912410MaRDI QIDQ2892732

Martin Raussen, Eric Goubault, E. Haucourt, Lisbeth Fajstrup, Samuel Mimram

Publication date: 22 June 2012

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.0414

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Related Items (8)

A geometric view of partial order reduction ⋮ Natural Homology ⋮ Geometric and combinatorial views on asynchronous computability ⋮ Iterated chromatic subdivisions are collapsible ⋮ Cut-off theorems for the \textit{PV}-model ⋮ Directed homology theories and Eilenberg-Steenrod axioms ⋮ Simplicial models for trace spaces. II: General higher dimensional automata ⋮ Execution spaces for simple higher dimensional automata

This page was built for publication: Trace Spaces: An Efficient New Technique for State-Space Reduction