#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2007

2017

- This year (1)
- Last 5 years (7)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Alexander Bau, Johannes Waldmann
- KDPD
- 2013

The paper presents a high-level declarative language CO4 for describing constraint systems. The language includes user-defined algebraic data types and recursive functions defined by pattern matching, as well as higher-order and polymorphic types. This language comes with a compiler that transforms a high-level constraint system into a satisfiability… (More)

- Alexander Bau, Markus Lohrey, Eric Nöth, Johannes Waldmann
- RTA
- 2013

We adapt the TreeRePair tree compression algorithm and use it as an intermediate step in proving termination of term rewriting systems. We introduce a cost function that approximates the size of constraint systems that specify compatibility of matrix interpretations. We show how to integrate the compression algorithm with the Dependency Pairs… (More)

- Alexander Bau
- 2017

- Christoph Schlueter Langdon, Alexander Bau
- Encyclopedia of Portal Technologies and…
- 2007

- Alexander Bau, Johannes Waldmann
- WLP/WFLP
- 2014

The CO4 language is a Haskell-like language for specifying constraint systems over structured finite domains. A CO4 constraint system is solved by an automatic transformation into a satisfiability problem in propositional logic that is handed to an external SAT solver. We investigate the problem of predicting the size of formulas produced by the CO4… (More)

- Heinz Fischer, Franz Baader, +24 authors Matthew Parkinson
- 2014

Fairness for Infinite-State Systems 11 Byron Cook, Heidy Khlaaf and Nir Piterman Reducing Deadlock and Livelock Freedom to Termination 16 Byron Cook, Stephen Magill, Matthew Parkinson and Thomas Stroeder Another Proof for the Recursive Path Ordering 21 Nachum Dershowitz Non-termination using Regular Languages 26 Joerg Endrullis and Hans Zantema A Solution… (More)

- Alexander Bau
- 2014

Due to the availability of powerful SAT solvers, propositional encoding is a successful technique of solving constraint systems over finite domains. As these domains are often flat and non-structured, the CO4 compiler aims to extend this concept by enriching the underlying domain with user-defined algebraic data types. Syntactically, CO4 is a subset of… (More)

We discuss design choices for SAT-encoding constraints for termination orders based on semantic labelling and unlabelling, linear interpretations, recursive path orders with argument filters, within the dependency pairs framework. We specify constraints in a high-level Haskell-like language, and translate to SAT fully automatically by the CO4 compiler. That… (More)

- Christoph Schlueter Langdon, Alexander Bau
- Encyclopedia of Portal Technologies and…
- 2007

- ‹
- 1
- ›