Sciweavers

551 search results - page 100 / 111
» {log}: A Logic Programming Language with Finite Sets
Sort
View
TSE
2010
140views more  TSE 2010»
13 years 6 months ago
Learning a Metric for Code Readability
—In this paper, we explore the concept of code readability and investigate its relation to software quality. With data collected from 120 human annotators, we derive associations...
Raymond P. L. Buse, Westley Weimer
ICALP
2009
Springer
14 years 8 months ago
High Complexity Tilings with Sparse Errors
Abstract. Tile sets and tilings of the plane appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). The idea is to enforce some global prop...
Bruno Durand, Andrei E. Romashchenko, Alexander Sh...
ECBS
2007
IEEE
142views Hardware» more  ECBS 2007»
14 years 2 months ago
Model-Driven Engineering for Development-Time QoS Validation of Component-Based Software Systems
Model-driven engineering (MDE) techniques are increasingly being used to address many of the development and operational lifecycle concerns of large-scale component-based systems....
James H. Hill, Sumant Tambe, Aniruddha S. Gokhale
LICS
2008
IEEE
14 years 2 months ago
Hiding Local State in Direct Style: A Higher-Order Anti-Frame Rule
Separation logic involves two dual forms of modularity: local reasoning makes part of the store invisible within a static scope, whereas hiding local state makes part of the store...
François Pottier
ACSD
2005
IEEE
162views Hardware» more  ACSD 2005»
14 years 1 months ago
Complexity Results for Checking Distributed Implementability
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
Keijo Heljanko, Alin Stefanescu