Sciweavers

517 search results - page 74 / 104
» Using dynamic logic programming to model legal reasoning
Sort
View
BIOINFORMATICS
2007
195views more  BIOINFORMATICS 2007»
13 years 8 months ago
Context-dependent clustering for dynamic cellular state modeling of microarray gene expression
Motivation: High-throughput expression profiling allows researchers to study gene activities globally. Genes with similar expression profiles are likely to encode proteins that ma...
Shinsheng Yuan, Ker-Chau Li
MAM
2007
157views more  MAM 2007»
13 years 7 months ago
Executing large algorithms on low-capacity FPGAs using flowpath partitioning and runtime reconfiguration
This paper describes a new method of executing a software program on an FPGA for embedded systems. Rather than combine reconfigurable logic with a microprocessor core, this method...
Darrin M. Hanna, Michael DuChene
PLDI
2006
ACM
14 years 1 months ago
Combining type-based analysis and model checking for finding counterexamples against non-interference
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
Hiroshi Unno, Naoki Kobayashi, Akinori Yonezawa
ICLP
2003
Springer
14 years 1 months ago
Concurrency, Time, and Constraints
Concurrent constraint programming (ccp) is a model of concurrency for systems in which agents (also called processes) interact with one another by telling and asking information in...
Frank D. Valencia
NFM
2011
252views Formal Methods» more  NFM 2011»
13 years 2 months ago
Call Invariants
Program verifiers based on first-order theorem provers model the program heap as a collection of mutable maps. In such verifiers, preserving unmodified facts about the heap acr...
Shuvendu K. Lahiri, Shaz Qadeer