Peter Schrammel : Publications

Assisted Coverage Closure

Adam Nellis‚ Pascal Kesseli‚ Philippa Ryan Conmy‚ Daniel Kroening‚ Peter Schrammel and Michael Tautschnig

In NASA Formal Methods Symposium‚ NFM 2016. Springer. 2016.

To appear.

Details about Assisted Coverage Closure | BibTeX data for Assisted Coverage Closure

Unbounded Safety Verification for Hardware Using Software Analyzers

Rajdeep Mukherjee‚ Peter Schrammel‚ Daniel Kroening and Tom Melham

In Design‚ Automation and Test in Europe‚ DATE 2016. 2016.

To appear.

Details about Unbounded Safety Verification for Hardware Using Software Analyzers | BibTeX data for Unbounded Safety Verification for Hardware Using Software Analyzers

2LS for Program Analysis − (Competition Contribution)

Peter Schrammel and Daniel Kroening

In Tools and Algorithms for the Construction and Analysis of Systems‚ TACAS 2016. Vol. 9636 of Lecture Notes in Computer Science. Pages 905–907. Springer. 2016.

Details about 2LS for Program Analysis − (Competition Contribution) | BibTeX data for 2LS for Program Analysis − (Competition Contribution) | Link to 2LS for Program Analysis − (Competition Contribution)

Unbounded−time reachability analysis of hybrid systems by abstract acceleration

Peter Schrammel

In Embedded Software‚ EMSOFT 2015. Pages 51–54. IEEE. 2015.

Details about Unbounded−time reachability analysis of hybrid systems by abstract acceleration | BibTeX data for Unbounded−time reachability analysis of hybrid systems by abstract acceleration | Link to Unbounded−time reachability analysis of hybrid systems by abstract acceleration

Synthesising Interprocedural Bit−Precise Termination Proofs

Hong−Yi Chen‚ Cristina David‚ Daniel Kroening‚ Peter Schrammel and Björn Wachter

In Automated Software Engineering‚ ASE 2015. Pages 53–64. IEEE. 2015.

Details about Synthesising Interprocedural Bit−Precise Termination Proofs | BibTeX data for Synthesising Interprocedural Bit−Precise Termination Proofs | Link to Synthesising Interprocedural Bit−Precise Termination Proofs

Unbounded−Time Analysis of Guarded LTI Systems with Inputs by Abstract Acceleration

Dario Cattaruzza‚ Alessandro Abate‚ Peter Schrammel and Daniel Kroening

In Static Analysis Symposium‚ SAS 2015. Vol. to appear of Lecture Notes in Computer Science. Springer. 2015.

Details about Unbounded−Time Analysis of Guarded LTI Systems with Inputs by Abstract Acceleration | BibTeX data for Unbounded−Time Analysis of Guarded LTI Systems with Inputs by Abstract Acceleration

Safety Verification and Refutation by k−Invariants and k−Induction

Martin Brain‚ Saurabh Joshi‚ Daniel Kroening and Peter Schrammel

In Static Analysis Symposium‚ SAS 2015. Vol. to appear of Lecture Notes in Computer Science. Springer. 2015.

Details about Safety Verification and Refutation by k−Invariants and k−Induction | BibTeX data for Safety Verification and Refutation by k−Invariants and k−Induction

Successful Use of Incremental BMC in the Automotive Industry

Peter Schrammel‚ Daniel Kroening‚ Martin Brain‚ Ruben Martins‚ Tino Teige and Tom Bienmüller

In Formal Methods for Industrial Critical Systems‚ FMICS 2015. Vol. 9128 of Lecture Notes in Computer Science. Pages 62–77. Springer. 2015.

Details about Successful Use of Incremental BMC in the Automotive Industry | BibTeX data for Successful Use of Incremental BMC in the Automotive Industry

Effective verification of low−level software with nested interrupts

Daniel Kroening‚ Lihao Liang‚ Tom Melham‚ Peter Schrammel and Michael Tautschnig

In Design‚ Automation & Test in Europe Conference & Exhibition‚ DATE 2015. Pages 229–234. ACM. 2015.

Details about Effective verification of low−level software with nested interrupts | BibTeX data for Effective verification of low−level software with nested interrupts

Generating test case chains for reactive systems

Peter Schrammel‚ Tom Melham and Daniel Kroening

In International Journal on Software Tools for Technology Transfer. Pages 1−16. 2014.

Details about Generating test case chains for reactive systems | BibTeX data for Generating test case chains for reactive systems

Abstract Acceleration in Linear Relation Analysis

Laure Gonnord and Peter Schrammel

In Science of Computer Programming. Vol. 93. Pages 125–153. 2014.

Details about Abstract Acceleration in Linear Relation Analysis | BibTeX data for Abstract Acceleration in Linear Relation Analysis

Necessary and Sufficient Preconditions via Eager Abstraction

Mohamed Nassim Seghir and Peter Schrammel

In Programming Languages and Systems‚ APLAS 2014. Vol. 8858 of Lecture Notes in Computer Science. Pages 236–254. Springer. 2014.

Details about Necessary and Sufficient Preconditions via Eager Abstraction | BibTeX data for Necessary and Sufficient Preconditions via Eager Abstraction

Accelerated test execution using GPUs

Ajitha Rajan‚ Subodh Sharma‚ Peter Schrammel and Daniel Kroening

In Automated Software Engineering‚ ASE '14. Pages 97–102. ACM. 2014.

Details about Accelerated test execution using GPUs | BibTeX data for Accelerated test execution using GPUs

Speeding Up Logico−Numerical Strategy Iteration

David Monniaux and Peter Schrammel

In Static Analysis Symposium‚ SAS'14. Vol. 8723 of Lecture Notes in Computer Science. Pages 253–267. Springer. 2014.

Details about Speeding Up Logico−Numerical Strategy Iteration | BibTeX data for Speeding Up Logico−Numerical Strategy Iteration

Model and Proof Generation for Heap−Manipulating Programs

Martin Brain‚ Cristina David‚ Daniel Kroening and Peter Schrammel

In European Symposium on Programming‚ ESOP'14. Vol. 8410 of Lecture Notes in Computer Science. Pages 432−452. Springer. 2014.

Details about Model and Proof Generation for Heap−Manipulating Programs | BibTeX data for Model and Proof Generation for Heap−Manipulating Programs

Abstract Acceleration of General Linear Loops

Bertrand Jeannet‚ Peter Schrammel and Sriram Sankaranarayanan

In Principles of Programming Languages‚ POPL'14. Vol. to appear. Pages 529−540. 2014.

Details about Abstract Acceleration of General Linear Loops | BibTeX data for Abstract Acceleration of General Linear Loops

Chaining Test Cases for Reactive System Testing

Peter Schrammel‚ Tom Melham and Daniel Kroening

In International Conference on Testing Software and Systems‚ ICTSS'13. Vol. 8254 of Lecture Notes in Computer Science. Pages 133−148. Springer. 2013.

Details about Chaining Test Cases for Reactive System Testing | BibTeX data for Chaining Test Cases for Reactive System Testing

Logico−Numerical Max−Strategy−Iteration

Peter Schrammel and Pavle Subotic

In Verification‚ Model Checking and Abstract Interpretation‚ VMCAI'13. Vol. 7737 of Lecture Notes in Computer Science. Pages 414−433. Springer. 2013.

Details about Logico−Numerical Max−Strategy−Iteration | BibTeX data for Logico−Numerical Max−Strategy−Iteration

Applying abstract acceleration to (co−)reachability analysis of reactive programs

Peter Schrammel and Bertrand Jeannet

In J. Symb. Comput.. Vol. 47. No. 12. Pages 1512−1532. 2012.

Details about Applying abstract acceleration to (co−)reachability analysis of reactive programs | BibTeX data for Applying abstract acceleration to (co−)reachability analysis of reactive programs

From hybrid data−flow languages to hybrid automata: a complete translation

Peter Schrammel and Bertrand Jeannet

In Hybrid Systems: Computation and Control‚ HSCC'12. Pages 167−176. ACM. 2012.

Details about From hybrid data−flow languages to hybrid automata: a complete translation | BibTeX data for From hybrid data−flow languages to hybrid automata: a complete translation

Logico−Numerical Abstract Acceleration and Application to the Verification of Data−Flow Programs

Peter Schrammel and Bertrand Jeannet

In Static Analysis Symposium‚ SAS'11. Vol. 6887 of Lecture Notes in Computer Science. Pages 233−248. Springer. 2011.

Details about Logico−Numerical Abstract Acceleration and Application to the Verification of Data−Flow Programs | BibTeX data for Logico−Numerical Abstract Acceleration and Application to the Verification of Data−Flow Programs

Extending Abstract Acceleration Methods to Data−Flow Programs with Numerical Inputs

Peter Schrammel and Bertrand Jeannet

In Electr. Notes Theor. Comput. Sci.. Vol. 267. No. 1. Pages 101−114. 2010.

Details about Extending Abstract Acceleration Methods to Data−Flow Programs with Numerical Inputs | BibTeX data for Extending Abstract Acceleration Methods to Data−Flow Programs with Numerical Inputs