Helmut Veith

According to our database1, Helmut Veith authored at least 146 papers between 1995 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Introduction to Model Checking.
Proceedings of the Handbook of Model Checking., 2018

Parameterized model checking of rendezvous systems.
Distributed Computing, 2018

2017
Complexity and Resource Bound Analysis of Imperative Programs Using Difference Constraints.
J. Autom. Reasoning, 2017

On the completeness of bounded model checking for threshold-based distributed algorithms: Reachability.
Inf. Comput., 2017

Para2: parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms.
Formal Methods in System Design, 2017

Empirical software metrics for benchmarking of verification tools.
Formal Methods in System Design, 2017

On compiling Boolean circuits optimized for secure multi-party computation.
Formal Methods in System Design, 2017

A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

On the Automated Verification of Web Applications with Embedded SQL.
Proceedings of the 20th International Conference on Database Theory, 2017

2016
Decidability in Parameterized Verification.
SIGACT News, 2016

A Short Counterexample Property for Safety and Liveness Verification of Fault-tolerant Distributed Algorithms.
CoRR, 2016

On the automated verification of web applications with embedded SQL.
CoRR, 2016

A simple and scalable static analysis for bound analysis and amortized complexity analysis.
Proceedings of the Software Engineering 2016, 2016

Empirical software metrics for benchmarking of verification tools.
Proceedings of the Software Engineering 2016, 2016

Monadic Second Order Finite Satisfiability and Unbounded Tree-Width.
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

Parameterized Systems in BIP: Design and Model Checking.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

Local Linearizability for Concurrent Container-Type Data Structures.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015
Decidability of Parameterized Verification
Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, 2015

Closure properties and complexity of rational sets of regular languages.
Theor. Comput. Sci., 2015

Loop Patterns in C Programs.
ECEASST, 2015

Difference Constraints: An adequate Abstraction for Complexity Analysis of Imperative Programs.
CoRR, 2015

Monadic second order finite satisfiability and unbounded tree-width.
CoRR, 2015

Local Linearizability.
CoRR, 2015

Compilation for Secure Two-Party Computations.
Proceedings of the Software Engineering & Management 2015, Multikonferenz der GI-Fachbereiche Softwaretechnik (SWT) und Wirtschaftsinformatik (WI), FA WI-MAW, 17. März, 2015

Extending ALCQIO with Trees.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Perspectives on White-Box Testing: Coverage, Concurrency, and Concolic Execution.
Proceedings of the 8th IEEE International Conference on Software Testing, 2015

Difference Constraints: An adequate Abstraction for Complexity Analysis of Imperative Programs.
Proceedings of the Formal Methods in Computer-Aided Design, 2015

What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms.
Proceedings of the Perspectives of System Informatics, 2015

SMT and POR Beat Counter Abstraction: Parameterized Model Checking of Threshold-Based Distributed Algorithms.
Proceedings of the Computer Aided Verification - 27th International Conference, 2015

2014
A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis.
CoRR, 2014

Extending ALCQIO with reachability.
CoRR, 2014

A Logic-Based Framework for Verifying Consensus Algorithms.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2014

Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms.
Proceedings of the Formal Methods for Executable Software Models, 2014

Concolic Testing of Concurrent Programs.
Proceedings of the Software Engineering 2014, Fachtagung des GI-Fachbereichs Softwaretechnik, 25. Februar, 2014

Reusing Information in Multi-Goal Reachability Analyses.
Proceedings of the Software Engineering 2014, Fachtagung des GI-Fachbereichs Softwaretechnik, 25. Februar, 2014

iDQ: Instantiation-Based DQBF Solving.
Proceedings of the POS-14. Fifth Pragmatics of SAT workshop, 2014

On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Vienna Summer of Logic.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014

Shape and Content - A Database-Theoretic Perspective on the Analysis of Data Structures.
Proceedings of the Integrated Formal Methods - 11th International Conference, 2014

Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability.
Proceedings of the Informal Proceedings of the 27th International Workshop on Description Logics, 2014

Shape and Content: Incorporating Domain Knowledge into Shape Analysis.
Proceedings of the Informal Proceedings of the 27th International Workshop on Description Logics, 2014

On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

Parameterized Model Checking of Rendezvous Systems.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

CBMC-GC: An ANSI C Compiler for Secure Two-Party Computations.
Proceedings of the Compiler Construction - 23rd International Conference, 2014

2013
Verification across Intellectual Property Boundaries.
ACM Trans. Softw. Eng. Methodol., 2013

On the Concept of Variable Roles and its Use in Software Analysis
CoRR, 2013

On the Structure and Complexity of Rational Sets of Regular Languages
CoRR, 2013

Shape and Content: Incorporating Domain Knowledge into Shape Analysis.
CoRR, 2013

Towards Modeling and Model Checking Fault-Tolerant Distributed Algorithms.
Proceedings of the Model Checking Software - 20th International Symposium, 2013

Con2colic testing.
Proceedings of the Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, 2013

Brief announcement: parameterized model checking of fault-tolerant distributed algorithms by abstraction.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

On the Structure and Complexity of Rational Sets of Regular Languages.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Parameterized model checking of fault-tolerant distributed algorithms by abstraction.
Proceedings of the Formal Methods in Computer-Aided Design, 2013

On the concept of variable roles and its use in software analysis.
Proceedings of the Formal Methods in Computer-Aided Design, 2013

Information Reuse for Multi-goal Reachability Analyses.
Proceedings of the Programming Languages and Systems, 2013

Challenges in compiler construction for secure two-party computation.
Proceedings of the PETShop'13, 2013

The first workshop on language support for privacy-enhancing technologies (PETShop'13).
Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

2012
Special Issue: Games in Verification.
J. Comput. Syst. Sci., 2012

Counter Attack on Byzantine Generals: Parameterized Model Checking of Fault-tolerant Distributed Algorithms
CoRR, 2012

Starting a Dialog between Model Checking and Fault-tolerant Distributed Algorithms
CoRR, 2012

Bound Analysis of Imperative Programs with the Size-change Abstraction (extended version)
CoRR, 2012

Proving Reachability Using FShell - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2012

Secure two-party computations in ANSI C.
Proceedings of the ACM Conference on Computer and Communications Security, 2012

2011
Malware Detection.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Decision Procedures in Soft, Hard and Bio-ware - Follow Up (Dagstuhl Seminar 11272).
Dagstuhl Reports, 2011

Bound Analysis of Imperative Programs with the Size-Change Abstraction.
Proceedings of the Static Analysis - 18th International Symposium, 2011

Seamless Testing for Models and Code.
Proceedings of the Fundamental Approaches to Software Engineering, 2011

2010
Semantic integrity in large-scale online simulations.
ACM Trans. Internet Techn., 2010

On the distributivity of LTL specifications.
ACM Trans. Comput. Log., 2010

Proactive Detection of Computer Worms Using Model Checking.
IEEE Trans. Dependable Sec. Comput., 2010

How did you specify your test suite.
Proceedings of the ASE 2010, 2010

New Challenges in the Development of Critical Embedded Systems - An "aeromotive" Perspective.
Proceedings of the Leveraging Applications of Formal Methods, Verification, and Validation, 2010

An Introduction to Test Specification in FQL.
Proceedings of the Hardware and Software: Verification and Testing, 2010

Precise static analysis of untrusted driver binaries.
Proceedings of 10th International Conference on Formal Methods in Computer-Aided Design, 2010

10161 Executive Summary - Decision Procedures in Software, Hardware and Bioware.
Proceedings of the Decision Procedures in Software, Hardware and Bioware, 18.04., 2010

10161 Abstracts Collection - Decision Procedures in Software, Hardware and Bioware.
Proceedings of the Decision Procedures in Software, Hardware and Bioware, 18.04., 2010

The Localization Reduction and Counterexample-Guided Abstraction Refinement.
Proceedings of the Time for Verification, 2010

2009
Brief Announcement: Efficient Model Checking of Fault-Tolerant Distributed Protocols Using Symmetry Reduction.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

An Abstract Interpretation-Based Framework for Control Flow Reconstruction from Binaries.
Proceedings of the Verification, 2009

Query-Driven Program Testing.
Proceedings of the Verification, 2009

Automated Software Analysis.
Proceedings of the 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2009

Embedding Formal Methods into Systems Engineering.
Proceedings of the 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2009

Encoding Treewidth into SAT.
Proceedings of the Theory and Applications of Satisfiability Testing, 2009

Role-Based Symmetry Reduction of Fault-Tolerant Distributed Protocols with Language Support.
Proceedings of the Formal Methods and Software Engineering, 2009

2008
Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2008

Jakstab: A Static Analysis Platform for Binaries.
Proceedings of the Computer Aided Verification, 20th International Conference, 2008

FShell: Systematic Test Case Generation for Dynamic Analysis and Measurement.
Proceedings of the Computer Aided Verification, 20th International Conference, 2008

2007
Software transformations to improve malware detection.
Journal in Computer Virology, 2007

Enforcing Semantic Integrity on Untrusted Clients in Networked Virtual Environments.
IACR Cryptology ePrint Archive, 2007

Verification Across Intellectual Property Boundaries
CoRR, 2007

Enforcing Semantic Integrity on Untrusted Clients in Networked Virtual Environments.
Proceedings of the 2007 IEEE Symposium on Security and Privacy (S&P 2007), 2007

On the Notion of Vacuous Truth.
Proceedings of the Logic for Programming, 2007

Using Verification Technology to Specify and Detect Malware.
Proceedings of the Computer Aided Systems Theory, 2007

Verification Across Intellectual Property Boundaries.
Proceedings of the Computer Aided Verification, 19th International Conference, 2007

2006
The first order definability of graphs: Upper bounds for quantifier depth.
Discrete Applied Mathematics, 2006

Environment Abstraction for Parameterized Verification.
Proceedings of the Verification, 2006

2005
An Iterative Framework for Simulation Conformance.
J. Log. Comput., 2005

Enforcing Semantic Integrity on Untrusted Clients in Networked Virtual Environments
CoRR, 2005

Model Checking: Back and Forth between Hardware and Software.
Proceedings of the Verified Software: Theories, 2005

From Temporal Logic Queries to Vacuity Detection.
Proceedings of the Verification of Infinite-State Systems with Applications to Security, 2005

Deterministic CTL Query Solving.
Proceedings of the 12th International Symposium on Temporal Representation and Reasoning (TIME 2005), 2005

Malware Engineering.
Proceedings of the Sicherheit 2005: Sicherheit, 2005

Ensuring Media Integrity on Third-Party Infrastructures.
Proceedings of the Security and Privacy in the Age of Ubiquitous Computing, IFIP TC11 20th International Conference on Information Security (SEC 2005), May 30, 2005

State/Event Software Verification for Branching-Time Specifications.
Proceedings of the Integrated Formal Methods, 5th International Conference, 2005

Detecting Malicious Code by Model Checking.
Proceedings of the Detection of Intrusions and Malware, 2005

Temporal Logic Model Checking.
Proceedings of the Handbook of Networked and Embedded Control Systems, 2005

2004
Modular Verification of Software Components in C.
IEEE Trans. Software Eng., 2004

Provably Secure Authentication of Digital Media Through Invertible Watermarks.
IACR Cryptology ePrint Archive, 2004

A Syntactic Characterization of Distributive LTL Queries.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Parameterized Vacuity.
Proceedings of the Formal Methods in Computer-Aided Design, 5th International Conference, 2004

Verification by Network Decomposition.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003
Counterexample-guided abstraction refinement for symbolic model checking.
J. ACM, 2003

Integrating Publish/Subscribe into a Mobile Teamwork Support Platform.
Proceedings of the Fifteenth International Conference on Software Engineering & Knowledge Engineering (SEKE'2003), 2003

SAT Based Predicate Abstraction for Hardware Verification.
Proceedings of the Theory and Applications of Satisfiability Testing, 2003

Modular Verification of Software Components in C.
Proceedings of the 25th International Conference on Software Engineering, 2003

Watermarking schemes provably secure against copy and ambiguity attacks.
Proceedings of the 2003 ACM workshop on Digital rights management 2003, Washington, 2003

Friends or Foes? Communities in Software Verification (Invited Lecture).
Proceedings of the Computer Science Logic, 17th International Workshop, 2003

Validity of CTL Queries Revisited.
Proceedings of the Computer Science Logic, 17th International Workshop, 2003

Counterexamples Revisited: Principles, Algorithms, Applications.
Proceedings of the Verification: Theory and Practice, 2003

2002
Datalog LITE: a deductive query language with linear time model checking.
ACM Trans. Comput. Log., 2002

On the complexity of data disjunctions.
Theor. Comput. Sci., 2002

Securing symmetric watermarking schemes against protocol attacks.
Proceedings of the Security and Watermarking of Multimedia Contents IV, 2002

Tree-Like Counterexamples in Model Checking.
Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

Automated Abstraction Refinement for Model Checking Large State Spaces Using SAT Based Conflict Analysis.
Proceedings of the Formal Methods in Computer-Aided Design, 4th International Conference, 2002

2001
Complexity of t-tautologies.
Ann. Pure Appl. Logic, 2001

Efficient Filtering in Publish-Subscribe Systems Using Binary Decision.
Proceedings of the 23rd International Conference on Software Engineering, 2001

Non-linear Quantification Scheduling in Image Computation.
Proceedings of the 2001 IEEE/ACM International Conference on Computer-Aided Design, 2001

Progress on the State Explosion Problem in Model Checking.
Proceedings of the Informatics - 10 Years Back. 10 Years Ahead., 2001

Using Combinatorial Optimization Methods for Quantification Scheduling.
Proceedings of the Correct Hardware Design and Verification Methods, 2001

2000
An Analytic Calculus for Quantified Propositional Gödel Logic.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2000

Executable Protocol Specification in ESL.
Proceedings of the Formal Methods in Computer-Aided Design, Third International Conference, 2000

Counterexample-Guided Abstraction Refinement.
Proceedings of the Computer Aided Verification, 12th International Conference, 2000

1999
Succinctness as a Source of Complexity in Logical Formalisms.
Ann. Pure Appl. Logic, 1999

Interpolation in fuzzy logic.
Arch. Math. Log., 1999

On the Undecidability of some Sub-Classical First-Order Logics.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

1998
Succinct Representation, Leaf Languages, and Projection Reductions.
Inf. Comput., 1998

Proof Theory of Fuzzy Logics: Urquhart's C and Related Logics.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

A General Method to Determine the Expression Complexity of Database Query Languages.
Proceedings of the Kurzfassungen, 1998

Quantifier Elimination in Fuzzy Logic.
Proceedings of the Computer Science Logic, 12th International Workshop, 1998

How to Encode a Logical Structure by an OBDD.
Proceedings of the 13th Annual IEEE Conference on Computational Complexity, 1998

1997
Languages Represented by Boolean Formulas.
Inf. Process. Lett., 1997

Modular Logic Programming and Generalized Quantifiers.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1997

Generalized Quantifiers in Logic Programs.
Proceedings of the Generalized Quantifiers and Computation, 1997

1996
Succinct Representation, Leaf Languages, and Projection Reductions.
Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

1995
Succinct Representation and Leaf Languages
Electronic Colloquium on Computational Complexity (ECCC), 1995

Second Order Logic and the Weak Exponential Hierarchies.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995


  Loading...