User Kai

10 votes

As a Teacher: Choosing a suitable programming language

answered Dec 6, 2016 at 9:10

7 votes

Accepted

Are 2 independent PDAs equivalent to a turing machine?

answered Aug 31 at 6:12

5 votes

Write Serialization for Cache Coherence in the presence of Store Buffers

answered Nov 16, 2016 at 9:12

4 votes

Linked Finite State Machine

answered Sep 14 at 3:54

3 votes

Intuitive explanation of Hoare assignment axiom

answered Nov 22, 2016 at 10:17

3 votes

How is it that programs can be identified with partial functions for programming language semantics?

answered Oct 3, 2018 at 12:10

2 votes

What does it mean to "strengthen the precondition and weaken the postcondition" in Hoare logic?

answered Jan 15, 2017 at 13:40

2 votes

Race condition, my doubt on Peterson's algorithm vs. C

answered Mar 3 at 22:15

2 votes

Can a program that terminates have a running time of infinity? (Or not have an upper bound)

answered Mar 5 at 2:42

1 vote

What is the Kripke semantic for a linear temporal logic?

answered Mar 7 at 21:29

1 vote

A proof of the completeness of PLTL (Propositional Linear Temporal Logic)

answered Mar 11 at 1:12

1 vote

Linked Finite State Machine

answered Sep 14 at 23:43

1 vote

Z Notation: sequence of sequences - find sum

answered Sep 23 at 15:23

1 vote

Why not n^2 comparisons in the Alien Dictionary problem on leetcode?

answered Nov 16 at 13:43

1 vote

Accepted

Which temporal logic is the one described in Manna & Pnueli's "The Temporal Logic of Reactive and Concurrent Systems: Specification"?

answered Mar 3 at 22:31

1 vote

Using the Consequence Rule

answered May 19, 2018 at 5:43

1 vote

Proving whether $\bf{K}$(Happy $\lor$Sad) $\implies$ $\neg \bf{K}($Happy) is satisfiable, valid or unsatisfiable

answered Sep 28, 2018 at 0:04

1 vote

Proving loop invariant for a possibly nonterminating while loop

answered Feb 3, 2022 at 7:34

1 vote

Why is LTL Model Checking in PSPACE

answered Jan 30, 2019 at 22:43

0 votes

Accepted

Loop-Invariant for a program fragment

answered Apr 3, 2019 at 10:03

0 votes

Proving that a specific grammar is ambiguous

answered Apr 11, 2019 at 12:06

0 votes

Typesetting LTL in Unicode?

answered Oct 9, 2019 at 4:17

0 votes

Finite State Automaton Language

answered Jan 26, 2017 at 5:48

0 votes

proving program equivalence

answered Feb 3, 2022 at 8:02

0 votes

Hoare Triple Derivation Example (Precondition False)

answered Jan 30 at 4:32

0 votes

Z-Specification = Routes

answered Feb 6 at 4:42

0 votes

Is there a model for the given logical formula, and if not, why?

answered Nov 7 at 20:55

0 votes

Accepted

How to find prefixes and suffixes for infinite languages? (Automata)

answered Nov 12 at 10:36

0 votes

How to interpret the concept of adjacent initial states in the FLP impossibility paper?

answered Sep 7 at 0:45

0 votes

What can i say about L1 given that L2, L1L2 and L2L1 are regular?

answered Aug 16 at 13:17

Stack Exchange Network

31 Answers

As a Teacher: Choosing a suitable programming language

Are 2 independent PDAs equivalent to a turing machine?

Write Serialization for Cache Coherence in the presence of Store Buffers

Linked Finite State Machine

Intuitive explanation of Hoare assignment axiom

How is it that programs can be identified with partial functions for programming language semantics?

What does it mean to "strengthen the precondition and weaken the postcondition" in Hoare logic?

Race condition, my doubt on Peterson's algorithm vs. C

Can a program that terminates have a running time of infinity? (Or not have an upper bound)

What is the Kripke semantic for a linear temporal logic?

A proof of the completeness of PLTL (Propositional Linear Temporal Logic)

Linked Finite State Machine

Z Notation: sequence of sequences - find sum

Why not n^2 comparisons in the Alien Dictionary problem on leetcode?

Which temporal logic is the one described in Manna & Pnueli's "The Temporal Logic of Reactive and Concurrent Systems: Specification"?

Using the Consequence Rule

Proving whether $\bf{K}$(Happy $\lor$Sad) $\implies$ $\neg \bf{K}($Happy) is satisfiable, valid or unsatisfiable

Proving loop invariant for a possibly nonterminating while loop

Why is LTL Model Checking in PSPACE

Loop-Invariant for a program fragment

Proving that a specific grammar is ambiguous

Typesetting LTL in Unicode?

Finite State Automaton Language

proving program equivalence

Hoare Triple Derivation Example (Precondition False)

Z-Specification = Routes

Is there a model for the given logical formula, and if not, why?

How to find prefixes and suffixes for infinite languages? (Automata)

How to interpret the concept of adjacent initial states in the FLP impossibility paper?

What can i say about L1 given that L2, L1L2 and L2L1 are regular?