Gerald Lüttgen

According to our database1, Gerald Lüttgen
  • authored at least 82 papers between 1996 and 2017.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Comparing trace recordings of automotive real-time software.
Proceedings of the 25th International Conference on Real-Time Networks and Systems, 2017

DSIbin: identifying dynamic data structures in C/C++ binaries.
Proceedings of the 32nd IEEE/ACM International Conference on Automated Software Engineering, 2017

2016
Nondeterministic Modal Interfaces.
Theor. Comput. Sci., 2016

CoreTAna: A Trace Analyzer for Reverse Engineering Real-Time Software.
Proceedings of the IEEE 23rd International Conference on Software Analysis, 2016

DSI: an evidence-based approach to identify dynamic data structures in C programs.
Proceedings of the 25th International Symposium on Software Testing and Analysis, 2016

A Generalised Theory of Interface Automata, Component Compatibility and Error.
Proceedings of the Integrated Formal Methods - 12th International Conference, 2016

POSTER: Identifying Dynamic Data Structures in Malware.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
Richer interface automata with optimistic and pessimistic compatibility.
Acta Inf., 2015

Special issue on "Comprehending asynchrony in specification and analysis" dedicated to Walter Vogler on the occasion of his 60th birthday.
Acta Inf., 2015

Nondeterministic Modal Interfaces.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Learning Assertions to Verify Linked-List Programs.
Proceedings of the Software Engineering and Formal Methods - 13th International Conference, 2015

2014
Symbolic object code analysis.
STTT, 2014

Special issue on Automated Verification of Critical Systems (AVoCS'12).
Sci. Comput. Program., 2014

2013
Richer Interface Automata with Optimistic and Pessimistic Compatibility.
ECEASST, 2013

Modal Interface Automata.
Logical Methods in Computer Science, 2013

Identifying Dynamic Data Structures by Learning Evolving Patterns in Memory.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

2012
Verifying compiled file system code.
Formal Asp. Comput., 2012

Preface.
ECEASST, 2012

On Parallel Software Verification Using Boolean Equation Systems.
Proceedings of the Model Checking Software - 19th International Workshop, 2012

Modal Interface Automata.
Proceedings of the Theoretical Computer Science, 2012

Introducing Fairness into Compositional Verification via Unidirectional Counters.
Proceedings of the 12th International Conference on Application of Concurrency to System Design, 2012

2011
Safe reasoning with Logic LTS.
Theor. Comput. Sci., 2011

To Parallelize or to Optimize?
J. Log. Comput., 2011

2010
Is observational congruence on µ-expressions axiomatisable in equational Horn logic?
Inf. Comput., 2010

Ready simulation for concurrency: It's logical!
Inf. Comput., 2010

Symbolic Object Code Analysis.
Proceedings of the Model Checking Software, 2010

What Is in a Step: New Perspectives on a Classical Question.
Proceedings of the Time for Verification, 2010

2009
Decision-diagram-based techniques for bounded reachability checking of asynchronous systems.
STTT, 2009

Using formal specifications to support testing.
ACM Comput. Surv., 2009

Model-Checking the Linux Virtual File System.
Proceedings of the Verification, 2009

Safe Reasoning with Logic LTS.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Verifying Compiled File System Code.
Proceedings of the Formal Methods: Foundations and Applications, 2009

On the Expressiveness of Refinement Settings.
Proceedings of the Fundamentals of Software Engineering, 2009

2008
Modeling and verification using UML Statecharts. By Doron Drusinsky. Published by Newnes Publishers, 2006, ISBN 0-7506-7617-5, 306 pages.
Softw. Test., Verif. Reliab., 2008

Measuring and Evaluating Parallel State-Space Exploration Algorithms.
Electr. Notes Theor. Comput. Sci., 2008

Preface.
Electr. Notes Theor. Comput. Sci., 2008

Embedded Systems Programming: Accessing Databases from Esterel.
EURASIP J. Emb. Sys., 2008

2007
Conjunction on processes: Full abstraction via ready-tree semantics.
Theor. Comput. Sci., 2007

Priority and abstraction in process algebra.
Inf. Comput., 2007

Exploiting interleaving semantics in symbolic state-space generation.
Formal Methods in System Design, 2007

Bounded Reachability Checking of Asynchronous Systems Using Decision Diagrams.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007

Ready Simulation for Concurrency: It's Logical!
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Is Observational Congruence Axiomatisable in Equational Horn Logic?
Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

Parallelising Symbolic State-Space Generators.
Proceedings of the Computer Aided Verification, 19th International Conference, 2007

Improving Static Variable Orders Via Invariants.
Proceedings of the Petri Nets and Other Models of Concurrency, 2007

2006
Bisimulation on speed: A unified approach.
Theor. Comput. Sci., 2006

Conjunction on Processes: Full-Abstraction Via Ready-Tree Semantics.
Proceedings of the Foundations of Software Science and Computation Structures, 2006

Blasting Linux Code.
Proceedings of the Formal Methods: Applications and Technology, 2006

Can Saturation Be Parallelised?
Proceedings of the Formal Methods: Applications and Technology, 2006

2005
Bisimulation on speed: Lower time bounds.
ITA, 2005

Preface.
Electr. Notes Theor. Comput. Sci., 2005

Bisimulation on Speed: A Unified Approach.
Proceedings of the Foundations of Software Science and Computational Structures, 2005

2004
Bisimulation on speed: worst-case efficiency.
Inf. Comput., 2004

Editorial.
Formal Asp. Comput., 2004

A-maze-ing Esterel.
Electr. Notes Theor. Comput. Sci., 2004

Bisimulation on Speed: Lower Time Bounds.
Proceedings of the Foundations of Software Science and Computation Structures, 2004

Accessing Databases within Esterel.
Proceedings of the Synchronous Programming - SYNCHRON'04, 28. November - 3. December 2004, 2004

2003
Editorial: Where Theory and Practice Meet.
Formal Asp. Comput., 2003

A Compositional Semantic Theory for Synchronous Component-based Design.
Proceedings of the CONCUR 2003, 2003

2002
The intuitionism behind Statecharts steps.
ACM Trans. Comput. Log., 2002

Towards a Model-Theory for Esterel.
Electr. Notes Theor. Comput. Sci., 2002

A Logical Process Calculus.
Electr. Notes Theor. Comput. Sci., 2002

Axiomatizing an Algebra of Step Reactions for Synchronous Languages.
Proceedings of the CONCUR 2002, 2002

2001
Saturation: An Efficient Iteration Strategy for Symbolic State-Space Generation.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2001

Statecharts: From Visual Syntax to Model-Theoretic Semantics.
GI Jahrestagung (1), 2001

A Faster-than Relation for Asynchronous Processes.
Proceedings of the CONCUR 2001, 2001

2000
A compositional approach to statecharts semantics.
Proceedings of the ACM SIGSOFT Symposium on Foundations of Software Engineering, 2000

Fully-Abstract Statecharts Semantics via Intuitionistic Kripke Models.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

A Semantic Theory for Heterogeneous System Design.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

Efficient Symbolic State-Space Construction for Asynchronous Systems.
ICATPN, 2000

1999
A Practical Approach to Implementing Real-Time Semantics.
Ann. Software Eng., 1999

Analyzing Mode Confusion via Model Checking.
Proceedings of the Theoretical and Practical Aspects of SPIN Model Checking, 1999

Statecharts Via Process Algebra.
Proceedings of the CONCUR '99: Concurrency Theory, 1999

1998
A Process Algebra with Distributed Priorities.
Theor. Comput. Sci., 1998

Pre-emptive modeling of concurrent and distributed systems.
Berichte aus der Informatik, Shaker, ISBN: 978-3-8265-3932-9, 1998

1997
Dynamic Priorities for Modeling Real-Time.
Proceedings of the Formal Description Techniques and Protocol Specification, 1997

An Algebraic Theory of Multiple Clocks.
Proceedings of the CONCUR '97: Concurrency Theory, 1997

1996
Modeling and Verifying Distributed Systems Using Priorities: A Case Study.
Software - Concepts and Tools, 1996

Compositional Minimisation of Finite State Systems Using Interface Specifications.
Formal Asp. Comput., 1996

Priorities for Modeling and Verifying Distributed Systems.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1996

A Process Algebra with Distributed Priorities.
Proceedings of the CONCUR '96, 1996

Non-monotone Fixpoint Iterations to Resolve Second Order Effects.
Proceedings of the Compiler Construction, 6th International Conference, 1996


  Loading...