Model checking of hierarchical state machines
SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Paths vs. trees in set-based program analysis
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking of hierarchical state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
The regular viewpoint on PA-processes
Theoretical Computer Science
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
Theoretical Computer Science
Simulation preorder over simple process algebras
Information and Computation
A generic approach to the static analysis of concurrent programs with procedures
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Counter machines and verification Problems
Theoretical Computer Science
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Model-Checking LTL with Regular Valuations for Pushdown Systems
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Demand-Driven Model Checking for Context-Free Processes
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Model Checking of Unrestricted Hierarchical State Machines
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Symbolic Strategy Synthesis for Games on Pushdown Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On Removing the Pushdown Stack in Reachability Constructions
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Verification of Embedded Reactive Fiffo Systems
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Verification of Systems with an Infinite State Space
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Resource-Constrained Model Checking of Recursive Programs
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Decidability of Reachability Problems for Classes of Two Counters Automata
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Reachability Analysis for Some Models of Infinite-State Transition Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Regular Model Checking Made Simple and Efficient
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Parametric Verification of a Group Membership Algorithm
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Model Checking CTL Properties of Pushdown Systems
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Reachability and Safety in Queue Systems
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
On the Complexity of Bisimulation Problems for Pushdown Automata
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Analysis of Recursive State Machines
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Model Checking Linear Properties of Prefix-Recognizable Systems
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Extrapolating Tree Transformations
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Interface Compatibility Checking for Software Modules
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Solving Pushdown Games with a Sigma3 Winning Condition
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Automatic Verification of Recursive Procedures with One Integer Parameter
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Languages, Rewriting Systems, and Verification of Infinite-State Systems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
An Algebraic Approach to the Static Analysis of Concurrent Software
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
A BDD-Based Model Checker for Recursive Programs
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Automatic verification of recursive procedures with one integer parameter
Theoretical Computer Science - Mathematical foundations of computer science
Verification in loosely synchronous queue-connected discrete timed automata
Theoretical Computer Science
Eliminating the storage tape in reachability constructions
Theoretical Computer Science
Analysis of SPKI/SDSI Certificates Using Model Checking
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Pushdown timed automata: a binary reachability characterization and safety verification
Theoretical Computer Science
Fundamenta Informaticae - Concurrency specification and programming
The complexity of bisimilarity-checking for one-counter processes
Theoretical Computer Science
Model checking LTL with regular valuations for pushdown systems
Information and Computation - TACS 2001
Complexity of weak bisimilarity and regularity for BPA and BPP
Mathematical Structures in Computer Science
Past pushdown timed automata and safety verification
Theoretical Computer Science - Implementation and application automata
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Beyond proof-of-compliance: security analysis in trust management
Journal of the ACM (JACM)
Analysis of recursive state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Model Checking C Programs Using F-SOFT
ICCD '05 Proceedings of the 2005 International Conference on Computer Design
Regular symbolic analysis of dynamic networks of pushdown systems
CONCUR 2005 - Concurrency Theory
Verification of qualitative constraints
CONCUR 2005 - Concurrency Theory
Weighted pushdown systems and their application to interprocedural dataflow analysis
Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
Parametric Verification of a Group Membership Algorithm
Theory and Practice of Logic Programming
Automatic verification of timed concurrent constraint programs
Theory and Practice of Logic Programming
Modular strategies for recursive game graphs
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
Model checking for process rewrite systems and a class of action-based regular properties
Theoretical Computer Science
On the analysis of interacting pushdown systems
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Permutation rewriting and algorithmic verification
Information and Computation
Disjunctive image computation for software verification
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Language based policy analysis in a SPKI Trust Management System
Journal of Computer Security
Complexity results on branching-time pushdown model checking
Theoretical Computer Science
Model checking of multi-applet javacard applications
CARDIS'02 Proceedings of the 5th conference on Smart Card Research and Advanced Application Conference - Volume 5
Journal of Computer Security - Special issue on CSFW15
The word problem for visibly pushdown languages described by grammars
Formal Methods in System Design
Undecidability of bisimilarity by defender's forcing
Journal of the ACM (JACM)
Subcubic algorithms for recursive state machines
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reachability in recursive Markov decision processes
Information and Computation
Compositional verification of sequential programs with procedures
Information and Computation
Reachability on prefix-recognizable graphs
Information Processing Letters
Efficient SAT-based bounded model checking for software verification
Theoretical Computer Science
WYSINWYX: What You See Is Not What You eXecute
Verified Software: Theories, Tools, Experiments
Model-Checking Large Finite-State Systems and Beyond
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
25 Years of Model Checking
Model Checking: From Tools to Theory
25 Years of Model Checking
Automata, Probability, and Recursion
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
When Is Reachability Intrinsically Decidable?
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Verification of qualitative Z constraints
Theoretical Computer Science
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Journal of the ACM (JACM)
Model Checking Recursive Programs with Exact Predicate Abstraction
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Dynamic Model Checking with Property Driven Pruning to Detect Race Conditions
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Recurrent Reachability Analysis in Regular Model Checking
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Games on Multi-stack Pushdown Systems
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Adding nesting structure to words
Journal of the ACM (JACM)
Electronic Notes in Theoretical Computer Science (ENTCS)
Unary automatic graphs: An algorithmic perspective
Mathematical Structures in Computer Science
On Decidability of LTL+Past Model Checking for Process Rewrite Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A Decision Procedure for Detecting Atomicity Violations for Communicating Processes with Locks
Proceedings of the 16th International SPIN Workshop on Model Checking Software
Verifying Parallel Programs with Dynamic Communication Structures
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
ACM Computing Surveys (CSUR)
Winning Regions of Pushdown Parity Games: A Saturation Method
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
The Reachability Problem over Infinite Graphs
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
An Ahead-of-time Yet Context-Sensitive Points-to Analysis for Java
Electronic Notes in Theoretical Computer Science (ENTCS)
A relational approach to interprocedural shape analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
Reachability Analysis of Synchronized PA Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Use of Automata-based Techniques in Symbolic Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Liveness Checking as Safety Checking for Infinite State Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Summarization for termination: no return!
Formal Methods in System Design
WYSINWYX: What you see is not what you eXecute
ACM Transactions on Programming Languages and Systems (TOPLAS)
Safety verification for two-way finite automata with monotonic counters
DLT'02 Proceedings of the 6th international conference on Developments in language theory
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Symbolic backwards-reachability analysis for higher-order pushdown systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Weighted pushdown systems and their application to interprocedural dataflow analysis
SAS'03 Proceedings of the 10th international conference on Static analysis
A generic framework for reasoning about dynamic networks of infinite-state processes
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Modular strategies for recursive game graphs
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Low-level library analysis and summarization
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Context-bounded analysis of multithreaded programs with dynamic linked structures
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Formal Methods in System Design
Complete SAT-based model checking for context-free processes
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Program analysis using weighted pushdown systems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Unary automatic graphs: an algorithmic perspective
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Analyzing stripped device-driver executables
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Interprocedural analysis of concurrent programs under a context bound
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Verification of higher-order computation: a game-semantic approach
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Information and Computation
Model checking FO(R) over one-counter processes and beyond
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
An extensible dialogue script for robot based on unification of state transition models
CIRA'09 Proceedings of the 8th IEEE international conference on Computational intelligence in robotics and automation
Model Checking of Component Protocol Conformance -- Optimizations by Reducing False Negatives
Electronic Notes in Theoretical Computer Science (ENTCS)
On (Omega-)regular model checking
ACM Transactions on Computational Logic (TOCL)
Verifying parallel programs with dynamic communication structures
Theoretical Computer Science
Program equivalence checking by two-tape automata
Cybernetics and Systems Analysis
Electronic Notes in Theoretical Computer Science (ENTCS)
An automata-theoretic approach to infinite-state systems
Time for verification
A DEXPTIME-complete Dolev-Yao theory with distributive encryption
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
A CTL-based logic for program abstractions
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
From multi to single stack automata
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Analysing mu-calculus properties of pushdown systems
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Extended computation tree logic
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Temporal specifications for services with unboundedly many passive clients
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
A saturation method for the modal μ-calculus over pushdown systems
Information and Computation
Diagnosability of pushdown systems
HVC'09 Proceedings of the 5th international Haifa verification conference on Hardware and software: verification and testing
Model-checking trace-based information flow properties
Journal of Computer Security
Normalization of linear horn clauses
SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications
Model checking büchi pushdown systems
FASE'11/ETAPS'11 Proceedings of the 14th international conference on Fundamental approaches to software engineering: part of the joint European conferences on theory and practice of software
On the decidability of model-checking for P systems
Journal of Automata, Languages and Combinatorics
Checking conformance of a producer and a consumer
Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering
Hybrid and first-order complete extensions of CaRet
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Model checking recursive programs with numeric data types
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Effcient CTL model-checking for pushdown systems
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Reasoning about threads with bounded lock chains
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Two variable vs. linear temporal logic in model checking and games
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
The flow-insensitive precision of Andersen's analysis in practice
SAS'11 Proceedings of the 18th international conference on Static analysis
Improved model checking of hierarchical systems
Information and Computation
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
On decidability of LTL model checking for process rewrite systems
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Regularity problems for visibly pushdown languages
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Undecidability results for bisimilarity on prefix rewrite systems
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
A next-generation platform for analyzing executables
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Verification of parameterized timed systems
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Visibly pushdown automata: from language equivalence to simulation and bisimulation
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Infinite state model-checking of propositional dynamic logics
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Model checking for database theoreticians
ICDT'05 Proceedings of the 10th international conference on Database Theory
Model checking for process rewrite systems and a class of action-based regular properties
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Reachability analysis of multithreaded software with asynchronous communication
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Improving pushdown system model checking
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Repair of boolean programs with an application to c
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Regular sets of higher-order pushdown stacks
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Recursive markov chains, stochastic grammars, and monotone systems of nonlinear equations
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
On-the-Fly reachability and cycle detection for recursive state machines
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Efficient reachability analysis of büchi pushdown systems for hardware/software co-verification
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Global reachability in bounded phase multi-stack pushdown systems
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Complexity results on branching-time pushdown model checking
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Improved algorithm complexities for linear temporal logic model checking of pushdown systems
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Verification of well-formed communicating recursive state machines
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology
Extended weighted pushdown systems
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Reasoning about threads communicating via locks
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
On computing reachability sets of process rewrite systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Verifying probabilistic procedural programs
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Symbolic reachability analysis of higher-order context-free processes
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Model Checking of Recursive Probabilistic Systems
ACM Transactions on Computational Logic (TOCL)
Algorithmic verification of asynchronous programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic checking of component protocols in component-based systems
SC'06 Proceedings of the 5th international conference on Software Composition
Rewriting models of boolean programs
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Analysis of recursive probabilistic models
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
On the membership problem for visibly pushdown languages
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Monotonic set-extended prefix rewriting and verification of recursive ping-pong protocols
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Towards a model-checker for counter systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Weighted pushdown systems and trust-management systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Verifying concurrent message-passing c programs with recursive calls
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Automata-Based verification of programs with tree updates
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
The minimal cost reachability problem in priced timed pushdown systems
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
On model checking for visibly pushdown automata
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Reachability under contextual locking
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
PuMoC: a CTL model-checker for sequential programs
Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
A saturation method for collapsible pushdown systems
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Synchronisation- and reversal-bounded analysis of multithreaded programs with counters
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Introspective pushdown analysis of higher-order programs
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
Automatic test generation from interprocedural specifications
TestCom'07/FATES'07 Proceedings of the 19th IFIP TC6/WG6.1 international conference, and 7th international conference on Testing of Software and Communicating Systems
SAS'07 Proceedings of the 14th international conference on Static Analysis
SAS'07 Proceedings of the 14th international conference on Static Analysis
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Pushdown module checking with imperfect information
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Alternating automata and a temporal fixpoint calculus for visibly pushdown languages
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
On the complexity of LTL model-checking of recursive state machines
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Reachability problem for weak multi-pushdown automata
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Linear-Time model-checking for multithreaded programs under scope-bounding
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Nondeterministic Phase Semantics and the Undecidability of Boolean BI
ACM Transactions on Computational Logic (TOCL)
Pushdown module checking with imperfect information
Information and Computation
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Weighted pushdown systems with indexed weight domains
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
LTL model-checking for malware detection
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
C-SHORe: a collapsible approach to higher-order verification
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Sound and precise malware analysis for android via pushdown reachability and entry-point saturation
Proceedings of the Third ACM workshop on Security and privacy in smartphones & mobile devices
Silent transitions in automata with storage
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Well-Structured pushdown systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Branching-time logics with path relativisation
Journal of Computer and System Sciences
Analyzing probabilistic pushdown automata
Formal Methods in System Design
| Hi-index | 0.01 |