- Sprache
-
Englisch
- Anmerkungen
-
Aachen, Techn. Hochsch., Diss., 2012
- Identifier
-
1021515078
Thema
Theoretische Informatik , Verifikation , Mathematische Logik , Synthese; Hochschulschrift
Beteiligte Personen und Organisationen
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
26.01.2023, 13:54 MEZ
Objekttyp
- Monografie
Beteiligte
Ähnliche Objekte (12)
Solving infinite games with bounds
Applications of automata learning in verification and synthesis
Applications of automata learning in verification and synthesis
Fast algorithms for decomposable graphs
Fast algorithms for decomposable graphs
Static termination analysis for prolog using term rewriting and SAT solving
Termination analysis for imperative programs operating on the heap
SAT encodings : from constraint-based termination analysis to circuit synthesis
Verifying probabilistic systems : new algorithms and complexity results
SAT encodings : from constraint-based termination analysis to circuit synthesis
Strategy machines : representation and complexity of strategies in infinite games
Model composition in model-checking
Solving infinite games with bounds
Applications of automata learning in verification and synthesis
Applications of automata learning in verification and synthesis
Fast algorithms for decomposable graphs
Fast algorithms for decomposable graphs
Static termination analysis for prolog using term rewriting and SAT solving
Termination analysis for imperative programs operating on the heap
SAT encodings : from constraint-based termination analysis to circuit synthesis
Verifying probabilistic systems : new algorithms and complexity results
SAT encodings : from constraint-based termination analysis to circuit synthesis
Strategy machines : representation and complexity of strategies in infinite games
Model composition in model-checking
Solving infinite games with bounds
Applications of automata learning in verification and synthesis
Applications of automata learning in verification and synthesis
Fast algorithms for decomposable graphs
Fast algorithms for decomposable graphs
Static termination analysis for prolog using term rewriting and SAT solving
Termination analysis for imperative programs operating on the heap
SAT encodings : from constraint-based termination analysis to circuit synthesis
Verifying probabilistic systems : new algorithms and complexity results
SAT encodings : from constraint-based termination analysis to circuit synthesis
Strategy machines : representation and complexity of strategies in infinite games