SciFe: Scala Framework for Efficient Enumeration of Data Structures with Invariants Ivan Kuraj ABSTRACT We introduce SciFe, a tool for automated generation of complex structures, suitable for tasks such as automated test

Source URL: lara.epfl.ch

• Higher-order functions
• Search algorithms
• Data types
• Type theory
• Enumerated type
• Backtracking
• Generator
• Brute-force search
• Combinatory logic
• Computing
• Software engineering
• Computer programming

GOVERNMEN PATRICIA C. BAT ES JEAN FULLER RICARDO LARA I-lOLLY J. MITCHELL

Source URL: www.calhr.ca.gov

• Bargaining
• Business
• Sociology
• California Department of Corrections and Rehabilitation
• Labor
• Bargaining unit

Test Generation through Programming in UDITA

Source URL: lara.epfl.ch

• Software testing
• Java Pathfinder
• Concolic testing
• Unit testing
• KeY
• Symbolic execution
• Null Object pattern
• D
• Test automation
• Computing
• Software engineering
• Computer programming

Complete Completion using Types and Weights Tihomir Gvero Viktor Kuncak Ivan Kuraj ´ Ecole

Source URL: lara.epfl.ch

• Programming language theory
• Proof theory
• Logic in computer science
• Models of computation
• Curry–Howard correspondence
• Philosophy of computer science
• Symbol
• Lambda calculus
• Monad
• Theoretical computer science
• Computer science
• Type theory

Development and Evaluation of LAV: an SMT-Based Error Finding Platform? System Description Milena Vujoˇsevi´c-Janiˇci´c1 and Viktor Kuncak2 1

Source URL: lara.epfl.ch

• Control flow
• Constraint programming
• Electronic design automation
• Logic in computer science
• Satisfiability Modulo Theories
• LLVM
• For loop
• C
• Static single assignment form
• Computing
• Software engineering
• Computer programming

COMUNICATO STAMPA COWO® GENNAIO 2013: NUOVO COWORKING COWO® A PESARO Coworking Cowo® Pesaro/CWP presso Lara Group spa – Strada dei Pioppi 12 – 61121 Pesaro COS’È IL COWORKING E CHI LO UTILIZZA

Source URL: www.coworkingproject.com

Linear Arithmetic with Stars Ruzica Piskac and Viktor Kuncak School of Computer and Communication Sciences, EPFL, Switzerland Abstract. We consider an extension of integer linear arithmetic with a “star” operator tak

Source URL: lara.epfl.ch

• Linear algebra
• Boolean algebra
• Electronic design automation
• Formal methods
• NP-complete problems
• Multiset
• Boolean satisfiability problem
• Vector space
• Theorems and definitions in linear algebra
• Mathematics
• Algebra
• Theoretical computer science

Collections, Cardinalities, and Relations Kuat Yessenov1⋆ , Ruzica Piskac2 , and Viktor Kuncak2⋆⋆ 1 2

Source URL: lara.epfl.ch

• Model theory
• Electronic design automation
• Logic in computer science
• NP-complete problems
• First-order logic
• Function
• Interpretation
• FO
• Boolean satisfiability problem
• Mathematics
• Logic
• Mathematical logic

Speculative Linearizability Rachid Guerraoui Viktor Kuncak Giuliano Losa

Source URL: lara.epfl.ch

• Fault-tolerant computer systems
• Concurrent computing
• Computer architecture
• Linearizability
• Consensus
• State machine replication
• Trace
• Distributed algorithm
• Consistency model
• Computing
• Transaction processing
• Concurrency control