Detail page

Knowledge Web

Person

Andreas Podelski

Hochschullehrer

Name	Andreas Podelski
Place	Freiburg im Breisgau (Wirkungsort) Deutschland
Academic degree	Prof. Dr.
Profession	Hochschullehrer (characteristic profession)
Related	Informatik (Studienfach)
Further information	Inhaber des Lehrstuhls für Softwaretechnik, Institut für Informatik, Universität Freiburg
Record type	Person
GND-Identifier	1077028164
Record ID	1077028164
Involved in show all Commutativity simplifies proofs of parameterized programs Systematic adaptation and investigation of the understandability of a formal pattern language Ultimate automizer and the abstraction of bitwise operations Formalisation and analysis of system requirements Stratified commutativity in verification algorithms for concurrent programs Ultimate automizer and the commuhash normal form Ultimate taipan and race detection in ultimate Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version) SMT solving, interpolation, and quantifiers Ultimate GemCutter and the axes of generalization Temporal prophecy for proving temporal properties of infinite-state systems Temporal prophecy for proving temporal properties of infinite-state systems Data flow in program verification Ultimate TreeAutomizer (CHC-COMP tool description) Fundamental techniques for the scalable analysis of systems New techniques for abstraction refinement Ultimate automizer and the search for perfect interpolants : : (competition contribution) Ultimate Taipan with dynamic block encoding : : (competition contribution) Ultimate Taipan with Dynamic Block Encoding : (Competition Contribution) A logic-based approach to system testing The class of timed automata with quasi-equal clocks A formal approach to the development of industrial cyber-physical systems Automated verification of system requirements and software specifications Guided search for hybrid systems based on coarse-grained space abstractions Abstraction-based analysis of hybrid automata = Abstraktions-basierte Analyse von Hybrid-Automaten Interpolation modulo theories Model checking for time division multiple access systems Traces, interpolants, and automata : a new approach to automatic software verification Interpolation in software model checking and fault localization = Interpolation in Software Model Checking und Defektlokalisierung Program analysis and black-box GUI testing = Program Analysis und Black-box GUI Testing Verification of business rules programs = Verifikation von Geschäftsregel-Programmen Static detection of inevitable errors = Statische Erkennung von unvermeidbaren Fehlern Transition-based directed model checking = Transitionsbasierte gerichtete Modellprüfung Verification of hypervisor subroutines written in Assembler = Verifikation von Hypervisorunterrutinen, geschrieben in Assembler

Please note

The beta version does not yet contain all functions and information of the DNB portal catalogue. If you are missing information or want to order a medium, please visit the page in the DNB portal catalogue via the following link:

Katalog der Deutschen Nationalbibliothek

Andreas Podelski

Commutativity simplifies proofs of parameterized programs

Systematic adaptation and investigation of the understandability of a formal pattern language

Ultimate automizer and the abstraction of bitwise operations

Formalisation and analysis of system requirements

Stratified commutativity in verification algorithms for concurrent programs

Ultimate automizer and the commuhash normal form

Ultimate taipan and race detection in ultimate

Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version)

SMT solving, interpolation, and quantifiers

Ultimate GemCutter and the axes of generalization

Temporal prophecy for proving temporal properties of infinite-state systems

Temporal prophecy for proving temporal properties of infinite-state systems

Data flow in program verification

Ultimate TreeAutomizer (CHC-COMP tool description)

Fundamental techniques for the scalable analysis of systems

New techniques for abstraction refinement

Ultimate automizer and the search for perfect interpolants : : (competition contribution)

Ultimate Taipan with dynamic block encoding : : (competition contribution)

Ultimate Taipan with Dynamic Block Encoding : (Competition Contribution)

A logic-based approach to system testing

The class of timed automata with quasi-equal clocks

A formal approach to the development of industrial cyber-physical systems

Automated verification of system requirements and software specifications

Guided search for hybrid systems based on coarse-grained space abstractions

Abstraction-based analysis of hybrid automata = Abstraktions-basierte Analyse von Hybrid-Automaten

Interpolation modulo theories

Model checking for time division multiple access systems

Traces, interpolants, and automata : a new approach to automatic software verification

Interpolation in software model checking and fault localization = Interpolation in Software Model Checking und Defektlokalisierung

Program analysis and black-box GUI testing = Program Analysis und Black-box GUI Testing

Verification of business rules programs = Verifikation von Geschäftsregel-Programmen

Static detection of inevitable errors = Statische Erkennung von unvermeidbaren Fehlern

Transition-based directed model checking = Transitionsbasierte gerichtete Modellprüfung

Verification of hypervisor subroutines written in Assembler = Verifikation von Hypervisorunterrutinen, geschrieben in Assembler