Pages that link to "Item:Q3095231"
From MaRDI portal
The following pages link to Software Engineering and Formal Methods (Q3095231):
Displaying 50 items.
- Distributed Implementation of Systems with Multiparty Interactions and Priorities (Q3095232) (← links)
- Broadcast Psi-calculi with an Application to Wireless Protocols (Q3095234) (← links)
- dCTL: A Branching Time Temporal Logic for Fault-Tolerant System Verification (Q3095236) (← links)
- A Machine-Checked Framework for Relational Separation Logic (Q3095237) (← links)
- Reverse Hoare Logic (Q3095238) (← links)
- Improving SAT Modulo ODE for Hybrid Systems Analysis by Combining Different Enclosure Methods (Q3095239) (← links)
- Runtime Verification of Component-Based Systems (Q3095241) (← links)
- Verifying B Proof Rules Using Deep Embedding and Automated Theorem Proving (Q3095242) (← links)
- Hybrid Specification of Reactive Systems: An Institutional Approach (Q3095244) (← links)
- Modular Modelling of Software Product Lines with Feature Nets (Q3095246) (← links)
- Synchronizing Asynchronous Conformance Testing (Q3095247) (← links)
- ProMoVer: Modular Verification of Temporal Safety Properties (Q3095249) (← links)
- Efficient Computation of Dominance in Component Systems (Short Paper) (Q3095251) (← links)
- Satisfiability Checking: Theory and Applications (Q4571125) (← links)
- Refinement-Based Verification of Communicating Unstructured Code (Q4571128) (← links)
- Combining Predicate Abstraction with Fixpoint Approximations (Q4571129) (← links)
- Finding Boundary Elements in Ordered Sets with Application to Safety and Requirements Analysis (Q4571130) (← links)
- LTL Parameter Synthesis of Parametric Timed Automata (Q4571131) (← links)
- Model Checking Simulation Rules for Linearizability (Q4571132) (← links)
- Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution (Q4571133) (← links)
- Incentive Stackelberg Mean-Payoff Games (Q4571136) (← links)
- Compositional Reasoning about Shared Futures (Q4899685) (← links)
- A Timed Mobility Semantics Based on Rewriting Strategies (Q4899686) (← links)
- Refactoring Proofs with Tactician (Q4988643) (← links)
- Clustering Formulation Using Constraint Optimization (Q4988644) (← links)
- Attributed Probabilistic P Systems and Their Application to the Modelling of Social Interactions in Primates (Q4988646) (← links)
- Automated Synthesis of Protocol Converters with BALM-II (Q4988649) (← links)
- An Experimental Spatio-Temporal Model Checker (Q4988650) (← links)
- A Computational Model of Internet Addiction Phenomena in Social Networks (Q4989703) (← links)
- Finding All Minimum-Size DFA Consistent with Given Examples: SAT-Based Approach (Q4989704) (← links)
- Intercepting Blackhole Attacks in MANETs: An ASM-based Model (Q4989707) (← links)
- Formalizing Monitoring Processes for Large-Scale Distributed Systems Using Abstract State Machines (Q4989710) (← links)
- A Formal Framework for Specifying and Verifying Microservices Based Process Flows (Q4989712) (← links)
- Reasoning About Sensing Uncertainty in Decision-Making for Self-adaptation (Q4989714) (← links)
- Using Coq for Formal Modeling and Verification of Timed Connectors (Q4989716) (← links)
- From Model Checking to a Temporal Proof for Partial Models (Q5194652) (← links)
- An In-Depth Investigation of Interval Temporal Logic Model Checking with Regular Expressions (Q5194653) (← links)
- PART$$_\mathrm {PW}$$: From Partial Analysis Results to a Proof Witness (Q5194654) (← links)
- Formalizing Timing Diagram Requirements in Discrete Duration Calculus (Q5194655) (← links)
- On Approximate Diagnosability of Metric Systems (Q5194656) (← links)
- Reasoning about Separation Using Abstraction and Reification (Q5268439) (← links)
- Spread the work: multi-threaded safety analysis for hybrid systems (Q6039384) (← links)
- Online Enumeration of All Minimal Inductive Validity Cores (Q6039387) (← links)
- Graph-based shape analysis beyond context-freeness (Q6039389) (← links)
- Runtime enforcement with reordering, healing, and suppression (Q6041274) (← links)
- Bit-precise verification of discontinuity errors under fixed-point arithmetic (Q6045065) (← links)
- Information Exchange Between Over- and Underapproximating Software Analyses (Q6111606) (← links)
- Information Flow Control-by-Construction for an Object-Oriented Language (Q6111610) (← links)
- Runtime Verification with Imperfect Information Through Indistinguishability Relations (Q6111611) (← links)
- Publication:3095232 (← links)