The following pages link to Helmut Veith (Q234696):
Displaying 50 items.
- Languages represented by Boolean formulas (Q290253) (← links)
- Empirical software metrics for benchmarking of verification tools (Q526771) (← links)
- Pebble-intervals automata and \(\text{FO}^2\) with two orders (Q782576) (← links)
- The first order definability of graphs: Upper bounds for quantifier depth (Q860411) (← links)
- Closure properties and complexity of rational sets of regular languages (Q888431) (← links)
- Succinct representation, leaf languages, and projection reductions (Q1271623) (← links)
- Succinctness as a source of complexity in logical formalisms (Q1302307) (← links)
- Parameterized model checking of rendezvous systems (Q1635829) (← links)
- On compiling Boolean circuits optimized for secure multi-party computation (Q1696583) (← links)
- Interpolation in fuzzy logic (Q1818593) (← links)
- On the complexity of data disjunctions. (Q1853503) (← links)
- Complexity and resource bound analysis of imperative programs using difference constraints (Q2398171) (← links)
- (Q2721191) (← links)
- Linear time Datalog and branching time logic (Q2734948) (← links)
- (Q2754081) (← links)
- On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic (Q2922635) (← links)
- A Logic-Based Framework for Verifying Consensus Algorithms (Q2938065) (← links)
- On the distributivity of LTL specifications (Q2946608) (← links)
- On the Structure and Complexity of Rational Sets of Regular Languages (Q2963928) (← links)
- On the Automated Verification of Web Applications with Embedded SQL (Q3174909) (← links)
- Introduction to Model Checking (Q3176359) (← links)
- Parameterized Model Checking of Rendezvous Systems (Q3190112) (← links)
- Counterexample-guided abstraction refinement for symbolic model checking (Q3452508) (← links)
- On the Notion of Vacuous Truth (Q3498452) (← links)
- Second order logic and the weak exponential hierarchies (Q3569000) (← links)
- Query-Driven Program Testing (Q3600472) (← links)
- An Abstract Interpretation-Based Framework for Control Flow Reconstruction from Binaries (Q3600477) (← links)
- Encoding Treewidth into SAT (Q3637156) (← links)
- (Q4218100) (← links)
- (Q4258578) (← links)
- (Q4263811) (← links)
- (Q4427894) (← links)
- (Q4501677) (← links)
- Local linearizability for concurrent container-type data structures (Q4608657) (← links)
- Extending ALCQIO with Trees (Q4635832) (← links)
- (Q4787240) (← links)
- (Q4944902) (← links)
- (Q4955352) (← links)
- (Q5227061) (← links)
- Monadic Second Order Finite Satisfiability and Unbounded Tree-Width (Q5278399) (← links)
- Computer Science Logic (Q5292659) (← links)
- Computer Science Logic (Q5292663) (← links)
- Verification: Theory and Practice (Q5305642) (← links)
- CONCUR 2004 - Concurrency Theory (Q5311479) (← links)
- Theory and Applications of Satisfiability Testing (Q5325852) (← links)
- Information Reuse for Multi-goal Reachability Analyses (Q5326302) (← links)
- An Introduction to Test Specification in FQL (Q5391520) (← links)
- State/Event Software Verification for Branching-Time Specifications (Q5429308) (← links)
- Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems (Q5458319) (← links)
- Automata, Languages and Programming (Q5466541) (← links)
