The following pages link to David A. Basin (Q1332774):
Displaying 50 items.
- (Q191935) (redirect page) (← links)
- Deciding safety and liveness in TPTL (Q402360) (← links)
- Greedily computing associative aggregations on sliding windows (Q477620) (← links)
- Distributed temporal logic for the analysis of security protocol models (Q549724) (← links)
- Scalable offline monitoring of temporal specifications (Q681469) (← links)
- On the semantics of Alice \& Bob specifications of security protocols (Q860900) (← links)
- Verifying a signature architecture: a comparative case study (Q877156) (← links)
- Monitoring of temporal first-order properties with aggregations (Q888414) (← links)
- Developing topology discovery in Event-B (Q1044181) (← links)
- Search in games with incomplete information: a case study using Bridge card play (Q1128766) (← links)
- Labelled modal logics: Quantifiers (Q1289100) (← links)
- A term equality problem equivalent to graph isomorphism (Q1332775) (← links)
- A recursion planning analysis of inductive completion (Q1353935) (← links)
- Decision procedures for inductive Boolean functions based on alternating automata (Q1399969) (← links)
- Bytecode verification by model checking (Q1405996) (← links)
- Natural deduction for non-classical logics (Q1577342) (← links)
- Program development schemata as derived rules (Q1583853) (← links)
- Algorithms for monitoring real-time properties (Q1647773) (← links)
- Structuring metatheory on inductive definitions (Q1854368) (← links)
- Induction using term orders (Q1915132) (← links)
- New uses of linear arithmetic in automated theorem proving by induction (Q1915133) (← links)
- Middle-out reasoning for synthesis and induction (Q1915136) (← links)
- A calculus for and termination of rippling (Q1915137) (← links)
- Almost event-rate independent monitoring (Q2008287) (← links)
- A formally verified, optimized monitor for metric first-order dynamic logic (Q2096466) (← links)
- Runtime verification of temporal properties over out-of-order data streams (Q2151259) (← links)
- Cutoff bounds for consensus algorithms (Q2164223) (← links)
- CryptHOL: game-based proofs in higher-order logic (Q2175214) (← links)
- Natural projection as partial model checking (Q2208303) (← links)
- Symbolic analysis of identity-based protocols (Q2303367) (← links)
- From natural projection to partial model checking and back (Q2324221) (← links)
- LTL is closed under topological closure (Q2448112) (← links)
- (Q2703702) (← links)
- (Q2754076) (← links)
- (Q2754082) (← links)
- (Q2782479) (← links)
- (Q2782480) (← links)
- Adding metatheoretic facilities to first-order theories (Q2785674) (← links)
- Monitoring Metric First-Order Temporal Properties (Q2796403) (← links)
- Towards an Awareness-Based Semantics for Security Protocol Analysis (Q2841215) (← links)
- (Q2848036) (← links)
- (Q2848475) (← links)
- Provably Repairing the ISO/IEC 9798 Standard for Entity Authentication (Q2894318) (← links)
- Enforceable Security Policies Revisited (Q2894329) (← links)
- Alice and Bob Meet Equational Theories (Q2945705) (← links)
- Automated complexity analysis based on ordered resolution (Q2947004) (← links)
- Model-Driven Development of Security-Aware GUIs for Data-Centric Applications (Q3092178) (← links)
- (Q3165946) (← links)
- Model Checking Security Protocols (Q3176380) (← links)
- Let’s Get Physical: Models and Methods for Real-World Security Protocols (Q3183515) (← links)
