The following pages link to David E. Nowak (Q781248):
Displaying 26 items.
- (Q436404) (redirect page) (← links)
- Certifying assembly with formal security proofs: the case of BBS (Q436406) (← links)
- Stochastic effects of multiple regulators on expression profiles in eukaryotes (Q781249) (← links)
- On the freeze quantifier in Constraint LTL: Decidability and complexity (Q868025) (← links)
- (Co)inductive proof systems for compositional proofs in reachability logic (Q1996855) (← links)
- A hierarchy of monadic effects for program verification using equational reasoning (Q2176680) (← links)
- Formal security proofs with minimal fuss: implicit computational complexity at work (Q2343128) (← links)
- Synchronous structures (Q2500524) (← links)
- (Q2754054) (← links)
- Verifying Reachability-Logic Properties on Rewriting-Logic Specifications (Q2945720) (← links)
- A Formalization of Polytime Functions (Q3088001) (← links)
- REASONING ABOUT TRANSFINITE SEQUENCES (Q3426789) (← links)
- Logical relations for monadic types (Q3545276) (← links)
- (Q4108163) (← links)
- (Q4247268) (← links)
- (Q4270076) (← links)
- (Q4411847) (← links)
- (Q4457460) (← links)
- (Q4536630) (← links)
- (Q4537134) (← links)
- A Calculus for Game-Based Security Proofs (Q4933210) (← links)
- A trustful monad for axiomatic reasoning with probability and nondeterminism (Q5152658) (← links)
- Computer Science Logic (Q5292670) (← links)
- Computer Science Logic (Q5311272) (← links)
- Automated Technology for Verification and Analysis (Q5491868) (← links)
- Formal definitions and proofs for partial (co)recursive functions (Q6615564) (← links)
