Sciweavers

1023 search results - page 114 / 205
» A Formal Method for Program Slicing
Sort
View
TKDE
2012
245views Formal Methods» more  TKDE 2012»
13 years 4 months ago
Semi-Supervised Maximum Margin Clustering with Pairwise Constraints
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
Hong Zeng, Yiu-ming Cheung
POPL
2004
ACM
15 years 7 months ago
Summarizing procedures in concurrent programs
The ability to summarize procedures is fundamental to building scalable interprocedural analyses. For sequential programs, procedure summarization is well-understood and used rout...
Shaz Qadeer, Sriram K. Rajamani, Jakob Rehof
TLDI
2009
ACM
111views Formal Methods» more  TLDI 2009»
15 years 10 months ago
A generic type-and-effect system
Type-and-effect systems are a natural approach for statically reasoning about a program’s execution. They have been used to track a variety of computational effects, for example...
Daniel Marino, Todd D. Millstein
PADL
2010
Springer
15 years 10 months ago
Implementing Query Answering for Hybrid MKNF Knowledge Bases
Abstract. Ontologies and rules are usually loosely coupled in knowledge representation formalisms. In fact, ontologies use open-world reasoning while the leading semantics for rule...
Ana Sofia Gomes, José Júlio Alferes,...
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
14 years 11 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...