- Model Checking Without a Model: An Analysis of the HeartBeat Monitor of a
- Assertion Checking Unified Sumit Gulwani1
- MODULAR DIFFERENCE LOGIC IS HARD NIKOLAJ BJRNER, ANDREAS BLASS, YURI GUREVICH,
- VS 3 : SMT Solvers for Program Verification Saurabh Srivastava 1,# , Sumit Gulwani 2 , and Je#rey S. Foster 1
- Continuity Analysis of Programs Swarat Chaudhuri
- Program Analysis as Constraint Solving Sumit Gulwani
- Program Verification as Probabilistic Inference Sumit Gulwani
- Published in the Proceedings of the Principles of Programming Languages (POPL), 2005 Precise Interprocedural Analysis
- Egon Borger, Erich Gradel, Yuri Gurevich The Classical Decision Problem
- partnersininnovation2 0 0 6 C i t i z e n s h i p R e p o R t In the 2006 Microsoft Global Citizenship Report,
- Citizenship Report Customers Partners + Developers Community Environment Employees
- About This Report Reporting Scope and Structure
- To learn more about this book, visit Microsoft Learning at http://www.microsoft.com/MSPress/books/10936.aspx
- Citizenship@ Microsoft Microsoft believes that it can make the
- Compositional May-Must Program Analysis: Unleashing the Power of Alternation
- Microsoft Certified Master Program and Certification Overview
- An introduction to the Malware Protection Center Understanding Anti-Malware
- The Microsoft Certified Master (MCM) program draws its strength from deep, hands-on product expertise delivered by instructors
- Prepared for Microsoft January 2010
- Microsoft Certified Master Master Perspectives
- Precise Pointer Reasoning for Dynamic Test Generation Bassem Elkarablieh
- Spreadsheet Compliance in the 2007 Microsoft Office System
- Code Splitting for Network Bound Web 2.0 Applications Benjamin Livshits
- Assertion Checking over Combined Abstraction of Linear Arithmetic and Uninterpreted
- Division and Modulus for Computer Scientists DAAN LEIJEN
- Lesson 1 Installing Exchange Server 2007 71 Quick Check
- Performance and Scale SQL Server 2008 Performance and Scale
- To learn more about this book, visit Microsoft Learning at http://www.microsoft.com/MSPress/books/10936.aspx
- EXPLOITING SYMMETRY WHEN MODELCHECKING SOFTWARE
- Can we contain Internet worms? Manuel Costa 1;2 , Jon Crowcroft 1 , Miguel Castro 2 and Antony Rowstron 2
- An Abstract Domain for Analyzing HeapManipulating LowLevel Software #
- Ranking Abstractions Aziem Chawdhary 1 , Byron Cook 2 , Sumit Gulwani 2 , Mooly Sagiv 3 , and
- Published in the Proceedings of the Principles of Programming Languages (POPL), 2003, pages 7484 Discovering Affine Equalities Using Random Interpretation
- From Program Verification to Program Synthesis Saurabh Srivastava
- OracleGuided ComponentBased Program Synthesis UC Berkeley
- On Kolmogorov Machines And Related Issues \Lambda Yuri Gurevich
- Logic of Infons: the Propositional Case YURI GUREVICH
- The Static Driver Verifier Research Platform Thomas Ball, Ella Bounimova, Vladimir Levin
- Object Invariants in Dynamic Contexts K. Rustan M. Leino1
- HILBERTIAN DEDUCTIVE SYSTEMS, INFON LOGIC, AND ANDREAS BLASS AND YURI GUREVICH
- A Combination Framework for Tracking Partition Sizes Sumit Gulwani
- Lifting Abstract Interpreters to Quantified Logical Domains Sumit Gulwani
- Published in "Static Analysis Symposium" (SAS), 2004, pages 212-227 A Polynomial-Time Algorithm for Global Value
- Line-Up: A Complete and Automatic Linearizability Checker Sebastian Burckhardt
- Finding and Reproducing Heisenbugs in Concurrent Programs Madanlal Musuvathi
- Fair Stateless Model Checking Madanlal Musuvathi Shaz Qadeer
- First-class Concurrency Testing and Debugging Thomas Ball, Sebastian Burckhardt, Madan Musuvathi, Shaz Qadeer
- VERIFYING CONCURRENT C PROGRAMS WITH
- Compositional Dynamic Test Generation (Extended Abstract)
- The Static Driver Verifier Research Platform
- A Numerical Abstract Domain based on Expression Abstraction and Max Operator
- Modular verification of static class invariants K. Rustan M. Leino1
- Towards imperative modules: Reasoning about invariants and sharing of mutable state (extended abstract)
- Using the Singularity Research Development Kit
- Submitted for publication -Please do not distribute Concurrent Programming with Revisions and Isolation Types
- Flexible types Robust type inference for first-class polymorphism
- HMF: Simple Type Inference for First-Class Polymorphism Daan Leijen
- HMF: Simple type inference for first-class polymorphism Daan Leijen
- Qualified Types for MLF Daan Leijen Andres Loh
- The Abroad A Functional Approach To Software Components
- Helium, for Learning Haskell Bastiaan Heeren Daan Leijen Arjan van IJzendoorn
- Division and Modulus for Computer Scientists DAAN LEIJEN
- Boogie: A Modular Reusable Verifier for Object-Oriented Programs
- Exception safety for C# K. Rustan M. Leino Wolfram Schulte
- VACID-0: Verification of Ample Correctness of Invariants of Data-structures, Edition 0
- DISTRIBUTED-KNOWLEDGE AUTHORIZATION LANGUAGE JANUARY 2008 REVISION
- Friends Need a Bit More: Maintaining Invariants Over Shared State
- On the Costs and Benefits of using PartialOrder Methods for the
- Lifting Abstract Interpreters to Quantified Logical Domains Sumit Gulwani
- Abstract Interpretation with Alien Expressions and Heap Structures
- Symmetry and Reduced Symmetry in Model Checking ?
- Exploring Very Large State Spaces Using Genetic Algorithms
- SPEED: Precise and Efficient Static Estimation of Program Computational Complexity
- Lifting Abstract Interpreters to Quantified Logical Domains Sumit Gulwani
- First-class labels for extensible rows Technical report: UU-CS-2004-051
- Inadequacy of Computable Loop Invariants ANDREAS BLASS
- Verification Condition Splitting K. Rustan M. Leino0
- Logic and the Challenge of Computer Science* YURI GUREVICH
- Measuring Reliability of Software Products Pankaj Jalote, Brendan Murphy, Mario Garzia, Ben Errez
- A theory of stream queries Yuri Gurevich1
- Monadic Simultaneous Rigid E-Uni cation and Related Problems
- Inferring Locks for Atomic Sections Sigmund Cherem
- Clientside Web Scripting with HaskellScript Erik Meijer, Daan Leijen, and James Hook
- Model Checking with MultiValued Logics Glenn Bruns Patrice Godefroid
- A Combination Framework for Tracking Partition Sizes (Full Version)
- Testing for Buffer Overflows with Length Abstraction Ru-Gang Xu1
- From Program Verification to Program Synthesis Saurabh Srivastava
- Constraint-based Approach for Analysis of Hybrid Systems
- Getting Started with Microsoft Code Contracts and
- Unit Testing Microsoft SharePoint Foundation with Behaviors
- Microsoft Pex Reference Manual Version 0.93 August 3, 2010
- Parameterized Test Patterns for Microsoft Pex
- Advanced Concepts: Parameterized Unit Testing with Microsoft Pex
- Microsoft Pex and Moles Extensions Writer's Guide
- FloPSy -Search-Based Floating Point Constraint Solving for Symbolic Execution
- DySy: Dynamic Symbolic Execution for Invariant Inference Christoph Csallner
- Rex: Symbolic Regular Expression Explorer Microsoft Research Technical Report MSR-TR-2009-137
- Microsoft Corporation Axum Programmer's
- LANGUAGE OVERVIEW Niklas Gustafsson
- Doloto: Detailed Walkthrough Page 1 of 23 DOLOTO: DETAILED WALKTHROUGH
- Z3 -a Tutorial Leonardo de Moura
- On deciding satisfiability by DPLL( + T ) and unsound theorem proving
- Proofs and Refutations, and Z3 Leonardo de Moura and Nikolaj Bjrner
- Model-based Theory Combination Leonardo de Moura1
- Leonardo de Moura Microsoft Research
- Leonardo de Moura Microsoft Research
- Leonardo de Moura and Nikolaj Bjrner Microsoft Research
- Johannes Kepler University Linz, Austria 2008
- Developing Efficient SMT Solvers CMU May 2007
- : SMT Solvers for Program Verification Saurabh Srivastava1,
- Synthesizing Switching Logic using Constraint Ankur Taly1
- Synthesizing Switching Logic for Safety and Dwell-Time Requirements
- Ranking Abstractions Aziem Chawdhary1
- CONTENT-DEPENDENT CHUNKING FOR DIFFERENTIAL COMPRESSION,
- Published in the Proceedings of the Principles of Programming Languages (POPL), 2005 Precise Interprocedural Analysis
- Published in the Proceedings of the Principles of Programming Languages (POPL), 2004, pages 342-352 Global Value Numbering using Random Interpretation
- Program Analysis using Random Interpretation Sumit Gulwani
- Exact Exploration and Hanging Algorithms Andreas Blass,1
- Int J Software Informatics, Vol.3, No.2-3, June/September 2009, pp. 149170 E-mail: ijsi@iscas.ac.cn International Journal of Software and Informatics, ISSN 1673-7288 http://www.ijsi.org
- MODULAR DIFFERENCE LOGIC IS HARD NIKOLAJ BJRNER, ANDREAS BLASS, YURI GUREVICH,
- One Useful Logic That Defines Its Own Truth
- Proving Church's Thesis Yuri Gurevich
- The Bulletin of Symbolic Logic Volume 14, Number 3, Sept. 2008
- A Note on Nested Words Andreas Blass
- 1 Introduction 2 2 The ASM computation model: How is it different? 4
- Program Termination and Well Partial Orderings
- On Bounded Exploration and Bounded Nondeterminism
- Play to Test Andreas Blass 1
- Ordinary Interactive Small-Step Algorithms, III ANDREAS BLASS
- Ordinary Interactive Small-Step Algorithms, II ANDREAS BLASS
- Observations on the Decidability of Transitions Yuri Gurevich1
- Intra-Step Interaction Yuri Gurevich
- Algorithms: A Quest for Absolute Definitions Andreas Blass
- Deciding Effectively Propositional Logic using DPLL and substitution sets
- The Decidability of Simultaneous Rigid E-Uni cation with One Variable
- Logician in the land of OS: Abstract State Machines in Microsoft
- A Quick Update on the Open Problems in Blass-Gurevich-Shelah's article
- On Polynomial Time Computation Over Unordered Structures
- Strong Extension Axioms and Shelah's Zero-One Law for
- THE LOGIC IN COMPUTER SCIENCE COLUMN Yuri GUREVICH
- Investigating Java Concurrency Using Abstract State Machines
- Formalizing Database Recovery Yuri Gurevich
- Existential Second-Order Logic over Strings (extended abstract)
- The Complexity of Query Reliability Erich Gradel
- A Variation on the Zero-One Law Andreas Blass, Yuri Gurevichy
- De nability and Unde nability with Real Order at the Background
- Monadic Simultaneous Rigid E-Uni cation and Related Problems
- Platonism, Constructivism, and Computer Proofs vs. Proofs by Hand
- Gurevich Abstract State Machines and Schonhage Storage Modi cation Machines
- Recursive Abstract State Machines Yuri Gurevich1
- Equivalence Is In The Eye Of The Beholder Yuri Gurevich1
- The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate
- On Finite Rigid Structures Yuri Gurevich Saharon Shelahy
- Evolving Algebras Yuri Gurevich
- Evolving Algebras and Partial Evaluation Yuri Gurevichy
- Evolving Algebras and Linear Time Hierarchy Andreas Blassyand Yuri Gurevichz
- Meta nite Model Theory Erich Gradel
- McColm's Conjecture Yuri Gurevich Neil Immermany Saharon Shelahz
- The Bakery Algorithm: Yet Another Specification and Verification0
- Logic Activities in Europe Yuri Gurevichy
- Evolving Algebras 1993: Lipari Guide Yuri Gurevich
- Feasible Functions Yuri Gurevich
- The Semantics of the C Programming Language Yuri Gurevich and James K. Huggins
- RANDOMIZING REDUCTIONS OF SEARCH PROBLEMS
- THE LOGIC IN COMPUTER SCIENCE COLUMN1 Yuri GUREVICH2
- On the reduction theory for average case complexity1
- On the Classical Decision Problem Yuri Gurevich y
- Matrix Decomposition Problem is Complete for the Average Case Yuri Gurevich
- Information Processing Letters 32 (1989) 41-45 North-Holland
- Algebraic Operational Semantics and Modula-2* Yuri Gurevich and James M. Morris
- Average Case Completeness Yuri Gurevich
- SIAM J. COMPUT. Vol. 16, No. 3, June 1987
- Chapter XIII Monadic Second-Order Theories
- Toward logic tailored for computational complexity by Yuri Gurevich1
- Nikolaj Bjrner Microsoft Research
- RAP -Resource Adaptive Programming with an application to robust and fast file copying
- Nikolaj Bjrner Microsoft Research
- Satisfiability Modulo Software Michal Jan Moskal
- Journal of Automated Reasoning manuscript No. (will be inserted by the editor)
- VCC: Contract-based Modular Verification of Concurrent C Markus Dahlweid, Michal Moskal, Thomas Santen, Stephan Tobies
- Rocket-Fast Proof Checking for SMT Solvers Michal Moskal
- Fx7 or In Software, It Is All About Quantifiers Michal Moskal
- E-matching for Fun and Profit Michal Moskal1,2
- Type Inference with Deferral Michal Moskal
- Page 1 July 2010ISSTA'2010 From Blackbox Fuzzing
- Page 1 April 2008Software Model Checking 2.0 Software Model CheckingSoftware Model Checking 2.02.0
- Proving Memory Safety of Floating-Point Computations by Combining Static and Dynamic Program Analysis
- Invariants, Modularity, and Rights Ernie Cohen1
- A Precise Yet Efficient Memory Model For C Ernie Cohen 1
- Compositional Modeling for Data-Centric Business Applications
- Protecting Critical Data in Unsafe Languages
- Efficiently Solving Quantified Bit-Vector Formulas Christoph M. Wintersteiger
- Deciding Effectively Propositional Logic using DPLL and substitution sets
- Leonardo de Moura Microsoft Research
- Leonardo de Moura Microsoft Research
- Leonardo de Moura Microsoft Research
- Leonardo de Moura Microsoft Research
- LTL Generalized Model Checking Revisited Patrice Godefroid1
- An Abort-Aware Model of Transactional Programming
- Dimensions in Program Synthesis [Invited Talk Paper]
- Synthesizing Switching Logic for Safety and Dwell-Time Requirements
- Sequential Abstract State Machines Capture Sequential Algorithms
- SPEED: Symbolic Complexity Bound Analysis Invited Talk
- Automatic Synthesis of Specifications from the Dynamic Observation of
- H/Direct : A Binary Foreign Language Interface for Haskell Sigbjorn Finne Daan Leijen Erik Meijer Simon Peyton Jones
- Automated Systematic Testing for ConstraintBased Interactive Services
- Parsec: Direct Style Monadic Parser Combinators For The Real World
- Iterative Context Bounding for Systematic Testing of Multithreaded Programs
- JSMeter: Characterizing Real-World Behavior of JavaScript Programs
- A Flexible Semantic Framework for Effects and Daan Leijen2
- A type directed translation of MLF to System F Daan Leijen
- Domain Specific Embedded Compilers Daan Leijen and Erik Meijer
- Flexible Types Robust type inference for first-class polymorphism
- Analysis and Testing of Concurrent Programs
- Computing Procedure Summaries for Interprocedural Analysis
- Controlflow Refinement and Progress Invariants for Bound Analysis
- Control-flow Refinement and Progress Invariants for Bound Analysis
- Iterators revisited: proof rules and implementation Bart Jacobs1
- Join Algorithms for the Theory of Uninterpreted Sumit Gulwani1
- SPEED: Symbolic Complexity Bound Analysis Invited Talk
- Inferring Object Invariants (Extended Abstract)
- Combining Abstract Interpreters Sumit Gulwani
- A Combination Framework for Tracking Partition Sizes Sumit Gulwani
- Join Algorithms for the Theory of Uninterpreted Functions #
- Scripting COM components in Haskell Simon Peyton Jones (simonpj@dcs.gla.ac.uk)
- The Design of a Task Parallel Library Daan Leijen, Wolfram Schulte, and Sebastian Burckhardt
- Doloto: Code Splitting for Network-Bound Web 2.0 Applications
- Operational Semantics for DKAL: Application and Analysis
- Extensible records with scoped labels Daan Leijen
- A Portable and Concise GUI Library for Haskell Daan Leijen
- The Spec# Programming System: An Overview Mike Barnett, K. Rustan M. Leino, and Wolfram Schulte
- Typed Abstract State Machines Giuseppe Del Castillo
- SMT@Microsoft Leonardo de Moura and Nikolaj Bjrner
- The Journal of Symbolic Logic Volume 74, Number 3, Sept. 2009
- ChangeDisc, PlayCD, ChangeDisc
- Semantics of Concurrent Revisions Sebastian Burckhardt1
- Persistent Queries in the Behavioral Theory of ANDREAS BLASS
- 5. Computational Line Geometry by Pottmann and Wallner. Books on Cryptography
- Leonardo de Moura Microsoft Research
- Parsec: Direct Style Monadic Parser Combinators For The Real World
- Functional Components Using COM components in Haskell
- Convenient Explicit Effects using Type Inference with Subeffects Technical Report MSR-TR-2010-80
- Local Verification of Global Invariants in Concurrent Programs
- Leonardo de Moura Microsoft Research
- Matrix Transformation is Complete for the Average Case
- Program Verification using Templates over Predicate Abstraction Saurabh Srivastava
- Dynamic PartialOrder Reduction for Model Checking Software
- Abstraction-based Model Checking using Modal Transition Systems
- Ordinary Interactive Small-Step Algorithms, I ANDREAS BLASS
- Andreas Blass1 and Yuri Gurevich2
- ASMs in the Classroom: Personal Experience Yuri Gurevich
- THE LOGIC IN COMPUTER SCIENCE COLUMN YURI GUREVICH
- Parameterized Unit Tests Nikolai Tillmann, Wolfram Schulte, Wolfgang Grieskamp
- Scenario-oriented Modeling in AsmL and its Instrumentation for Testing Mike Barnett, Wolfgang Grieskamp, Yuri Gurevich,
- Assertion Checking over Combined Abstraction of Linear Arithmetic and Uninterpreted
- DOLOTO: EXECUTIVE SUMMARY Ben Livshits (dolotofb@microsoft.com)
- Functioneel Programmeren met Helium Bastiaan Heeren en Daan Leijen
- Tailoring recursion for complexity Erich Gradel
- Demand-Driven Compositional Symbolic Execution
- Unit Testing Asp.NET Applications with Moles and Pex
- Interactive Algorithms 2005 with Added Appendix
- Microsoft Moles Reference Manual Version 0.93 August 9, 2010
- An AbortAn Abort--Aware Model ofAware Model of Transactional ProgrammingTransactional Programming
- Programming with Triggers Michal Moskal
- VCC: A Practical System for Verifying Concurrent C
- SIAM J. COMPUT. c 2007 Society for Industrial and Applied Mathematics Vol. 37, No. 2, pp. 425459
- Automated Whitebox Fuzz Testing Patrice Godefroid
- SMT@Microsoft Leonardo de Moura and Nikolaj Bjrner
- Generating Finite State Machines from Abstract State Machines
- Semantic Essence of AsmL: Extended Abstract
- Definability in Rationals with Real Order in the Yuri Gurevich
- Relevancy Propagation Leonardo de Moura and Nikolaj Bjrner
- THE LOGIC IN COMPUTER SCIENCE COLUMN YURI GUREVICH
- Parameterized Unit Tests Nikolai Tillmann
- Choiceless Polynomial Time Andreas Blass
- Effective Program Verification for Relaxed Memory Models
- Doloto: Code Splitting for Network-Bound Web 2.0 Applications
- PLDI'2005 Page 1 June 2005 Directed Automated Random TestingDirected Automated Random Testing
- SpecNCheck Page 1 August 2001 Model Checking of SoftwareModel Checking of Software
- DART: Directed Automated Random Testing Patrice Godefroid Nils Klarlund
- PASTE 2004 Page 1 June 2004 ""Model CheckingModel Checking"" Software withSoftware with
- Microsoft Tech Report MSR-TR-2010-94 Semantics of Concurrent Revisions
- THE TOWER-OF-BABEL PROBLEM, AND SECURITY ASSESSMENT SHARING
- Syntax vs. Semantics on Finite Structures Natasha Alechina1 and Yuri Gurevich?2
- This is Boogie 2 K. Rustan M. Leino
- A Combination Framework for Tracking Partition Sizes (Full Version)
- Combining Abstract Interpreters Sumit Gulwani
- Active Property Checking Patrice Godefroid
- Fast Quantifier Reasoning With Lazy Proof Explication
- Annalsof Pure and Applied Logic 32 (1986) 1-16 North-Holland
- Z3: An Efficient SMT Solver McMaster University 2007
- Unit Testing with Microsoft Moles Tutorial for Lightweight Test Stubs and Detours for
- Computing Procedure Summaries for Interprocedural Analysis
- Grobner Basis Construction Algorithms Based on Theorem Proving Saturation Loops
- Leonardo de Moura Microsoft Research
- Reachability Analysis for Annotated Code Mikolas Janota1
- Grammar-based Whitebox Fuzzing Patrice Godefroid
- DKAL 2 --A Simplified and Improved Authorization Language
- Safe Concurrency for Aggregate Objects with Invariants Bart Jacobs0
- Bugs, Moles and Skeletons: Symbolic Reasoning for Software Development
- VeriSoft: A Tool for the Automatic Analysis of Concurrent Reactive Software
- JSMeter: Comparing Popular Web Applications and JavaScript Benchmarks (executive summary)
- The ReachabilityBound Problem Sumit Gulwani
- 30 I E E E S o f t wa r E Pu b l i s h e d b y t h e I EEE C o m p u t e r S o c i e t y 0 74 0 -74 5 9 / 0 8 / $ 2 5 . 0 0 2 0 0 8 I E E E software development tools
- Edit and Verify Radu Grigore1
- THE LOGIC IN COMPUTER SCIENCE COLUMN Yuri GUREVICH
- Abstract State Machines Capture Parallel Algorithms
- Evidential Authorization Andreas Blass,1
- Published in ``Static Analysis Symposium'' (SAS), 2004, pages 212227 A PolynomialTime Algorithm for Global Value
- SPEED: Precise and Efficient Static Estimation of Program Computational Complexity
- Assertion Checking Unified Sumit Gulwani 1 and Ashish Tiwari 2
- Calling hell from heaven and heaven from hell Sigbjorn Finne
- Efficient evaluation of pointer predicates with Z3 SMT Solver in SLAM2
- Abstract--Remote Differential Compression (RDC) protocols can efficiently update files over a limited-
- Database Query Processing Using Finite Cursor Machines
- Average Case Complexity Yuri Gurevich
- Page 1 June 2006MOVEP 2006 Software Model CheckingSoftware Model Checking
- The Reachability-Bound Problem Sumit Gulwani
- Demand-Driven Compositional Symbolic Execution
- Haskell as an Automation Controller Daan Leijen, Erik Meijer, and James Hook
- Abstract Communication Model for Distributed Systems
- Software Verification & Testing Abstraction
- The Logic in Computer Science Column Yuri GUREVICH
- In nite Games Yuri Gurevichy
- Can we contain Internet worms? Manuel Costa1 2
- Continuity Analysis of Programs Swarat Chaudhuri
- Abstract State Machines Capture Parallel Algorithms: Correction and Extension
- SPEED: Precise and Efficient Static Estimation of Program Computational Complexity
- The Logic of Choice Andreas Blass
- A Practical Verification Methodology for Concurrent Programs
- SIAM J. COMPUT. Vol. 13, No. 4, November 1984
- What does O(n) mean? Yuri Gurevich1
- The Challenger-Solver game: Variations on the theme of P =?NP
- Algebraic Operational Semantics and Occam Yuri Gurevich
- EVOLVING ALGEBRAS: AN ATTEMPT TO DISCOVER SEMANTICS
- Curb Your Theory ! A circumscriptive approach for
- Annals of Pure and Applied Logic, 78 (1996), 111{125. Normal Forms for Second-Order Logic over
- The Linear Time Hierarchy Theorems for Abstract State Machines and RAMs
- Decidability and Complexity of Simultaneous Rigid E-Uni cation with One Variable and
- THE LOGIC IN COMPUTER SCIENCE COLUMN 1 Yuri GUREVICH 2
- THE LOGIC IN COMPUTER SCIENCE COLUMN1 Yuri GUREVICH2
- Partially Ordered Runs: a Case Study Yuri Gurevich1
- Logical Methods in Computer Science Vol. 3 (4:4) 2007, pp. 135
- Choiceless Polynomial Time Computation and the Zero-One Law
- Using Abstract State Machines at Microsoft: A Case Study
- Spectra of Monadic Second-Order Formulas with One Unary Function
- Abstract State Machines: An Overview of the Project
- Semantic Essence of AsmL Yuri Gurevich, Benjamin Rossman, Wolfram Schulte
- Logical Methods in Computer Science Vol. 3 (4:3) 2007, pp. 129
- DKAL: Distributed-Knowledge Authorization Language Yuri Gurevich
- THE LOGIC IN COMPUTER SCIENCE COLUMN1 Yuri GUREVICH2
- THE LOGIC IN COMPUTER SCIENCE COLUMN YURI GUREVICH
- SMT Solvers: Theory and Implementation Summer School on Logic and Theorem Proving
- Efficient E-matching for SMT Solvers Leonardo de Moura and Nikolaj Bjrner
- Z3: An Efficient SMT Solver Leonardo de Moura and Nikolaj Bjrner
- Reliability Growth in Software Products Pankaj Jalote
- Unit Tests Reloaded: Parameterized Unit Testing with Symbolic Execution
- Exploring Code with Microsoft Pex Tutorial for Automated Whitebox Testing for
- May 1997 Draft of the ASM Guide Yuri Gurevich
- Leonardo de Moura Microsoft Research
- Group Membership Protocol: Speci cation and Veri cation
- ICALP 2004 Page 1 July 2004 Model CheckingModel Checking
- Lifting Abstract Interpreters to Quantified Logical Domains Sumit Gulwani
- EXISTENTIAL FIXED-POINT LOGIC Andreas Blass and Yuri Gurevich
- Getting Started with Microsoft Pex Automated Whitebox Testing for .NET
- Monotone versus Positive MIKLOS AJTAI
- LTL Generalized Model CheckingLTL Generalized Model Checking RevisitedRevisited
- AMAST'91 Banquet Talk Yuri Gurevich
- Bound Analysis of Imperative Programs with the Size-change Abstraction
