- SB CSE 675 Program Transformation and Program Analysis Handout Q Fall 2000 Annie Liu Sep. 5, 2000
- Dynamic Programming via Static Incrementalization
- Spring 2003 Stony Brook
- Attribute Closure . Calculating attribute closure is a more efficient
- Eliminating Dead Code on Recursive Data Yanhong A. Liu \Lambda and Scott D. Stoller ?
- SQL in the Real World Interactive vs. NonInteractive SQL
- Solving Regular Path Queries ? Yanhong A. Liu and Fuxiang Yu
- CSE/ISE 315 Spring 2006
- Parametric Regular Path Queries Yanhong A. Liu Tom Rothamel Fuxiang Yu Scott D. Stoller
- Generating Optimized Code from SCR Specifications Tom Rothamel
- Transaction Processing Performance Tool v.1.4 Help Contents
- Models of Transactions Structuring Applications
- Automatic Accurate TimeBound Analysis for HighLevel Languages
- Loop optimization for aggregate array computations Yanhong A. Liu \Lambda and Scott D. Stoller \Lambda
- Participation Constraint . If every entity participates in at least one
- From Datalog Rules to Efficient Programs with Time and Space Guarantees #
- Efficient Runtime Invariant Checking: A Framework and Case Study
- Artificial Intelligence } Course overview
- Strengthening Invariants for Ecient Computation ?
- Static Caching for Incremental Computation YANHONG A. LIU and SCOTT D. STOLLER
- Spring 2003 Stony Brook
- . Schema element . Part of external schema
- Semantic Constraints . Used for application dependent conditions
- Principled strength reduction Yanhong A. Liu \Lambda
- . Supports equality and range searches, multiple attribute keys and partial key
- Problem solving and search Chapter 3, Sections 1{5
- CSE/ISE 315 Spring 2006
- Automatic Accurate Live Memory Analysis for GarbageCollected Languages
- Eliminating Dead Code on Recursive Data ? Yanhong A. Liu, Scott D. Stoller
- Optimized Live Heap Bound Analysis Leena Unnikrishnan Scott D. Stoller Yanhong A. Liu ?
- XQuery --XML Query Language . Integrates XPath with earlier proposed
- Caching Intermediate Results for Program Improvement Yanhong A. Liu \Lambda Tim Teitelbaum \Lambda
- The Relational Data Model Data and Its Structure
- Database Design I: The EntityRelationship Model
- CSE/ISE 305 Spring 2002
- CSE/ISE 308 Spring 2010
- Relational Algebra and SQL Relational Query Languages
- Third Normal Form . Compromise --Not all redundancy
- Implementing Isolation Maintaining database correctness when
- Lossless Schema Decomposition . A decomposition should not lose information
- Intelligent Agents } Agents and environments
- An Overview of Query Optimization
- Automatic Accurate Cost-Bound Analysis for High-Level Languages
- From Datalog Rules to Efficient Programs with Time and Space Guarantees
- From Datalog Rules to Efficient Programs with Time and Space Guarantees
- "!$#%&'()102435(67'(8(735(9026@8A'(&CBD(61E4!$8'(8( FGIHQPQRHQSUTWVYXa`cbYd efgRhihpCVehRIqrqtsvu5w xy`txsg`thsgqtYGIbQd
- More Efficient Datalog Queries: Subsumptive Tabling Beats Magic Sets
- Model Checking Linearizability via Renement , Wei Chen2
- Generating Incremental Implementations of Object-Set Queries
- Analysis and Transformations for Efficient Query-based Debugging Michael Gorbovitski K. Tuncay Tekle Tom Rothamel Scott D. Stoller Yanhong A. Liu
- Generating specialized rules and programs for demand-driven analysis
- Efficient Trust Management Policy Analysis from Rules Katia Hristova , K. Tuncay Tekle, and Yanhong A. Liu
- Automated Software Engineering Using Concurrent Class Machines Radu Grosu Yanhong A. Liu Scott Smolka Scott D. Stoller Jingyu Yan
- Spring 2011 Stony Brook
- Spring 2010 Stony Brook
- Isolation in Relational Databases What's Different About Locking
- Implementing Atomicity and System Malfunctions
- Implementing Distributed Transactions
- Security and Electronic Security in Transaction
- Creating Personal Information Assistants for Targeted Navigation and Extraction via a Web Browser
- Spring 2004 Stony Brook
- XML Query Languages XPath core query language. Very limited, a
- 1. Write the query of Exercise 6.19 using TRC and DRC: Find the names of all brokers who have made money in all accounts assigned to them.
- Implementing Query Answering for Hybrid MKNF Knowledge Bases
- Composing transformations for instrumentation and incrementalization of real applications
- The Architecture of Transaction Processing Systems
- . Used as a relation, but rows are not physically --The contents of a view is computed when it is used
- Describing, Transforming, and Querying Semistructured Data
- Querying Complex Graphs Yanhong A. Liu and Scott D. Stoller
- Spring 2003 Stony Brook
- Representation in SQL . Each role of relationship type produces a
- Stony Brook Advanced Database Systems
- Parametric Regular Path Queries # Yanhong A. Liu Tom Rothamel Fuxiang Yu Scott D. Stoller
- A Closer Look . We are particularly interested in relational
- Automatic TimeBound Analysis for a HigherOrder Language \Lambda
- Graph Queries through Datalog Optimizations K. Tuncay Tekle Michael Gorbovitski Yanhong A. Liu
- Integrity Constraints . Part of schema
- Spring 2004 Stony Brook
- Spring 2009 Stony Brook
- Spring 2011 Stony Brook
- A Language and Framework for Invariant-Driven Transformations Yanhong A. Liu Michael Gorbovitski Scott D. Stoller
- Improved Algorithm Complexities for Linear Temporal Logic Model Checking
- Efficient Type Inference for Secure Information Flow Katia Hristova, Tom Rothamel, Yanhong A. Liu, and Scott D. Stoller
- Optimizing Aggregate Array Computations in Loops Yanhong A. Liu Scott D. Stoller Ning Li Tom Rothamel
- YouTube.com/jobs To find out more about joining the YouTube team, go to
- Systematic Derivation of Incremental Programs \Lambda Yanhong A. Liu y , Tim Teitelbaum
- Precise Complexity Analysis for Efficient Datalog Queries K. Tuncay Tekle Yanhong A. Liu
- Incrementalization Across Object Abstraction Yanhong A. Liu1
- Discovering Auxiliary Information for Incremental Computation Yanhong A. Liu \Lambda Scott D. Stoller y Tim Teitelbaum \Lambda
- Relational Normalization Theory Limitations of ER Designs
- Spring 2003 Stony Brook
- Physical Data Organization and Access Path
- Dynamic Programming via Static Incrementalization Yanhong A. Liu and Scott D. Stoller
- Spring 2009 Stony Brook
- Alias Analysis for Optimization of Dynamic Languages Michael Gorbovitski Yanhong A. Liu Scott D. Stoller Tom Rothamel K. Tuncay Tekle
- Role-Based Access Control: A Simplified Specification Yanhong A. Liu Scott D. Stoller
- Optimizing Ackermann's Function by Incrementalization # Yanhong A. Liu Scott D. Stoller
- Efficient Implementation of Tuple Pattern Based Retrieval Tom Rothamel Yanhong A. Liu
- Overview of Databases and Transaction Processing
- Iterate, incrementalize, and implement: A systematic approach to eciency improvement and guarantees
- Automated Software Engineering Using Concurrent Class Machines Radu Grosu Yanhong A. Liu Scott Smolka Scott D. Stoller Jingyu Yan
- Indices: The Down Side . Additional I/O to access index pages (except if
- Eciency by Incrementalization: An Introduction
- From recursion to iteration: what are the optimizations? Yanhong A. Liu \Lambda and Scott D. Stoller \Lambda
- Program optimization using indexed and recursive data structures
- Solving Regular Tree Grammar Based Constraints ? Yanhong A. Liu 1 , Ning Li 2 , and Scott D. Stoller 1
- programming input/output
- . Goal: Produce the tuples in one relation, r, that match all tuples in another relation, s
- Core Role-Based Access Control: Efficient Implementations by Transformations
- CSE/ISE 308 Spring 2010
- Dynamic SQL . Problem: Application might not know in
- Triggers and Active Databases Trigger Overview
- Query Processing: The Basics External Sorting
- Optimizing Ackermann's Function by Incrementalization Yanhong A. Liu Scott D. Stoller
- Composing Transformations for Instrumentation and Optimization
- Composing Transformations for Instrumentation and Optimization
- Composing Transformations for Instrumentation and Optimization
