Searching for authors named Viktor Kuncak – sorted by Relevance.
-
Towards efficient satisfiability checking for boolean algebra with presburger arithmetic
- Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic Viktor
- Cited by 5 (3 self) – Add To MetaCart
-
Reducibility Method for Simple Types and Church-Rosser Property
- @(email omitted); Viktor Kuncak viktor@(email omitted); No Institute Given Abstract. A general reducibility method for proving
- Add To MetaCart
-
Modular Language Specifications in Haskell
- Modular Language Specications in Haskell Mirjana Ivanovic, Viktor Kuncak Institute of Mathematics
- Add To MetaCart
-
On Generalized Records and Spatial Conjunction in Role Logic
- On Generalized Records and Spatial Conjunction in Role Logic Viktor Kuncak and Martin Rinard MIT
- Cited by 9 (4 self) – Add To MetaCart
-
Typestate checking and regular graph constraints
- arXiv:cs.PL/0408014 v1 5 Aug 2004 Typestate Checking and Regular Graph Constraints Viktor
- Cited by 5 (4 self) – Add To MetaCart
-
Existential heap abstraction entailment is undecidable
- Existential Heap Abstraction Entailment is Undecidable Viktor Kuncak and Martin Rinard Laboratory
- Cited by 9 (3 self) – Add To MetaCart
-
On Role Logic
- On Role Logic Viktor Kuncak and Martin Rinard Computer Science and Artificial Intelligence
- Cited by 11 (6 self) – Add To MetaCart
-
Structural Subtyping of Non-Recursive Types is Decidable
- and inferring program prop- ∗ Produced April 7, 2003, 11:02pm for submission to LICS 2003 Viktor Kuncak
- Cited by 23 (4 self) – Add To MetaCart
-
An Overview of the Jahob Analysis System - Project Goals and Current Status
- An Overview of the Jahob Analysis System Project Goals and Current Status Viktor Kuncak and Martin
- Cited by 3 (1 self) – Add To MetaCart
-
On the theory of structural subtyping
- of Structural Subtyping Viktor Kuncak and Martin Rinard Laboratory for Computer Science Massachusetts Institute
- Cited by 16 (6 self) – Add To MetaCart

