Sciweavers

2041 search results - page 223 / 409
» Balance Machines: Computing = Balancing
Sort
View
FMSD
2008
110views more  FMSD 2008»
15 years 5 months ago
Automatic symbolic compositional verification by learning assumptions
Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
Wonhong Nam, P. Madhusudan, Rajeev Alur
ENTCS
2006
142views more  ENTCS 2006»
15 years 5 months ago
The Rewriting Logic Semantics Project
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational semantics and structural operational semantics (SOS) in a novel way, avoiding th...
José Meseguer, Grigore Rosu
MSS
2008
IEEE
58views Hardware» more  MSS 2008»
15 years 5 months ago
Voting with preferences over margins of victory
This paper analyzes a two-alternative voting model with the distinctive feature that voters have preferences over the support that each alternative receives, and not only over the...
Humberto Llavador
AIL
2004
111views more  AIL 2004»
15 years 5 months ago
Anonymity and software agents: An interdisciplinary challenge
Software agents that play a role in E-commerce and E-government applications involving the Internet often contain information about the identity of their human user such as credit ...
Frances M. T. Brazier, Anja Oskamp, Corien Prins, ...
JSS
2007
123views more  JSS 2007»
15 years 5 months ago
Do programmer pairs make different mistakes than solo programmers?
Objective: Comparison of program defects caused by programmer pairs and solo developers. Design: Analysis of programs developed during two counter balanced experiments. Setting: P...
Matthias M. Müller