Pages that link to "Item:Q1398474"
From MaRDI portal
The following pages link to Encoding transition systems in sequent calculus (Q1398474):
Displaying 17 items.
- Nominal abstraction (Q617715) (← links)
- Relating state-based and process-based concurrency through linear logic (full-version) (Q731895) (← links)
- Macrotransducers and applicative systems for partially continuous functions (Q1407110) (← links)
- Attributed transition systems with hidden transitions (Q1709456) (← links)
- Logic of transition systems (Q1895974) (← links)
- Cut elimination for a logic with induction and co-induction (Q1948276) (← links)
- A proof theory for model checking (Q2331070) (← links)
- Modal transition system encoding of featured transition systems (Q2423766) (← links)
- Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols (Q2643568) (← links)
- Encoding generic judgments: preliminary results (Q2841234) (← links)
- Extracting Proofs from Tabled Proof Search (Q2938048) (← links)
- A hybrid linear logic for constrained transition systems (Q2968415) (← links)
- (Q4508395) (← links)
- (Q4699293) (← links)
- Relating State-Based and Process-Based Concurrency through Linear Logic (Q4917995) (← links)
- Constructing weak simulations from linear implications for processes with private names (Q5236556) (← links)
- Relating reasoning methodologies in linear logic and process algebra (Q5741581) (← links)