Pages that link to "Item:Q3393396"

The following pages link to Theoretical Aspects of Computing - ICTAC 2009 (Q3393396):

Displayed 20 items.

• Static Analysis of Concurrent Programs Using Ordinary Differential Equations (Q3393397) ‎ (← links)
• The PlusCal Algorithm Language (Q3393398) ‎ (← links)
• The Secret Art of Computer Programming (Q3393399) ‎ (← links)
• ν-Types for Effects and Freshness Analysis (Q3393400) ‎ (← links)
• A First-Order Policy Language for History-Based Transaction Monitoring (Q3393401) ‎ (← links)
• Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete (Q3393402) ‎ (← links)
• Transmission Protocols for Instruction Streams (Q3393403) ‎ (← links)
• A Deadlock-Free Semantics for Shared Memory Concurrency (Q3393404) ‎ (← links)
• On the Expressiveness of Forwarding in Higher-Order Communication (Q3393405) ‎ (← links)
• On the Hairpin Completion of Regular Languages (Q3393406) ‎ (← links)
• Context-Free Languages of Countable Words (Q3393407) ‎ (← links)
• Automatic Conflict Detection on Contracts (Q3393409) ‎ (← links)
• A Sound Observational Semantics for Modal Transition Systems (Q3393411) ‎ (← links)
• Regular Expressions with Numerical Constraints and Automata with Counters (Q3393412) ‎ (← links)
• On the Relative Expressive Power of Contextual Grammars with Maximal and Depth-First Derivations (Q3393413) ‎ (← links)
• Integration Testing from Structured First-Order Specifications via Deduction Modulo (Q3393414) ‎ (← links)
• A Minimized Assumption Generation Method for Component-Based Software Verification (Q3393416) ‎ (← links)
• A Formal Approach to Heuristically Test Restorable Systems (Q3393417) ‎ (← links)
• Constrained Reachability of Process Rewrite Systems (Q3393418) ‎ (← links)
• Input-Output Model Programs (Q3393419) ‎ (← links)